103 search results - page 11 / 21 » Oblivious routing on geometric networks |
MOBISYS
2005
ACM
15 years 11 months ago
2005
ACM
Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping syste...
100
click to vote
PDCAT
2005
Springer
15 years 5 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
ISPA
2005
Springer
15 years 5 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
113
click to vote
ISCA
2005
IEEE
15 years 5 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract-- We study routing for massively dense wireless networks, i.e., wireless networks that contain so many nodes that, in addition to their usual microscopic description, a no...