18 search results - page 2 / 4 » Near-optimal oblivious routing on three-dimensional mesh net... |
169
click to vote
ISPA
2005
Springer
15 years 11 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...
145
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
154
click to vote
ICC
2008
IEEE
16 years 15 days ago
2008
IEEE
—Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing pl...
157
click to vote
SECON
2008
IEEE
16 years 12 days ago
2008
IEEE
—Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best solution, existing work proposes to formulate the mesh ...
162
click to vote
IEEEPACT
2009
IEEE
16 years 21 days ago
2009
IEEE
—Oblivious routing can be implemented on simple router hardware, but network performance suffers when routes become congested. Adaptive routing attempts to avoid hot spots by re-...