198 search results - page 1 / 40 » A practical algorithm for constructing oblivious routing sch... |
SPAA
2003
ACM
13 years 10 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...
MOBIHOC
2012
ACM
11 years 7 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
CLUSTER
2009
IEEE
13 years 11 months ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
CAL
2002
13 years 4 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...