66 search results - page 1 / 14 » Optimal oblivious routing in polynomial time |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
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...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
ASPLOS
2010
ACM
13 years 8 months ago
2010
ACM
We present an all-optical approach to constructing data networks on chip that combines the following key features: (1) Wavelengthbased routing, where the route followed by a packe...