103 search results - page 3 / 21 » Oblivious routing on geometric networks |
ICC
2008
IEEE
15 years 6 months 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...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
101
Voted
SPAA
2003
ACM
15 years 4 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
103
click to vote
NOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Most virtual channel routers have multiple virtual channels to mitigate the effects of head-of-line blocking. When there are more flows than virtual channels at a link, packets o...
ANCS
2009
ACM
14 years 9 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...