Yossi Azar
Edith Cohen
Amos Fiat
ABSTRACT
A recent seminal result of Racke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Racke's construction is not polynomial time. We give a polynomial time construction that guarantee's Racke's bounds, and more generally gives the true optimal ratio for any network.
- D. Applegate and E. Cohen. Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. Mansucript., 2003.Google Scholar
Digital Library
- J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3):486--504, 1997. Also in Proc. 25th ACM STOC, 1993, pp. 623--631. Google ScholarDigital Library
- B. Awerbuch and Y. Azar. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation. In FOCS 35, pages 240--249, 1994.Google ScholarDigital Library
- A. Borodin and J. E. Hopcroft. Routing, merging and sorting on parallel models of computation. Journal of Computer and System Sciences, 30(1):130--145, 1985. Google ScholarDigital Library
- B. Grötschel, L. Lovasz, and A. Schrijver. Geometric algorithms and combinatorial optimization. Springer-Verlag, New York, 1988.Google ScholarCross Ref
- C. Kaklamanis, D. Krizanc, and A. Tsantilas. Tight bounds for oblivious routing in the hypercube. In Proc. 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 31--36, 1990. Google ScholarDigital Library
- F. T. Leighton. Introduction to Parallel Algorithms and Architectures Arrays, Trees, Hypercubes,. MorganKaufmann Publishers, 1992. Google ScholarDigital Library
- S. Leonardi. On-line network routing. In A. Fiat and G. Woeginger, editors, Online Algorithms - The State of the Art, chapter 11, pages 242--267. Springer, 1998. Google ScholarDigital Library
- H. Räcke. Minimizing congestion in general networks. In FOCS 43, 2002. Google ScholarDigital Library
- P. Raghavan and C. D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365--374, 1987. Google ScholarDigital Library
- N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In Proceedings of the ACM SIGCOMM'02 Conference. ACM, 2002. Google ScholarDigital Library
- L. G. Valiant and G. Brebner. Universal schemes for parallel communication. In Proceedings of the 13th ACM Symposium on Theory of Computing, pages 263--277, 1981. Google ScholarDigital Library
Index Terms
- Optimal oblivious routing in polynomial time
Recommendations
Hop-constrained oblivious routing
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingWe prove the existence of an oblivious routing scheme that is poly(logn)-competitive in terms of (congestion + dilation), thus resolving a well-known question in oblivious routing.
Concretely, consider an undirected network and a set of packets each ...
A polynomial-time tree decomposition to minimize congestion
SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architecturesRäcke recently gave a remarkable proof showing that any undirected multicommodity flow problem can be routed in an oblivious fashion with congestion that is within a factor of O(log3 n) of the best off-line solution to the problem. He also presented ...
Optimal oblivious routing in polynomial time
Special issue: STOC 2003A recent seminal result of Räcke is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a ...
Comments