5079 search results - page 353 / 1016 » Hidden-Action in Network Routing |
174
click to vote
GD
2008
Springer
15 years 8 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
149
Voted
DATE
2009
IEEE
16 years 2 months ago
2009
IEEE
—We present the aEqualized routing algorithm: a novel algorithm for the Spidergon Network on Chip. AEqualized combines the well known aFirst and aLast algorithms proposed in lite...
194
Voted
ICCCN
2008
IEEE
16 years 2 months ago
2008
IEEE
: Recent studies on inter-domain DWDM networks used on topology abstraction for state summarization, i.e., transforming a physical topology to a virtual mesh, tree, or star network...
191
Voted
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
203
Voted
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper investigates routing strategies for mobile and heterogeneous multi-hop wireless networks. We leverage the knowledge about users mobility to improve the efficiency o...