Marcin Bienkowski
Miroslaw Korzeniowski
ABSTRACT
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 scheme consists of probability distributions over s-t paths for every source-target pair s,t in the network.In a recent result [11] it was shown that for any undirected network there is an oblivious routing scheme that achieves a polylogarithmic competitive ratio with respect to congestion. Subsequently, Azar et al. [4] gave a polynomial time algorithm that for a given network constructs the best oblivious routing scheme, i.e. the scheme that guarantees the best possible competitive ratio. Unfortunately, the latter result is based on the Ellipsoid algorithm; hence it is unpractical for large networks.In this paper we present a combinatorial algorithm for constructing an oblivious routing scheme that guarantees a competitive ratio of O(log4n) for undirected networks. Furthermore, our approach yields a proof for the existence of an oblivious routing scheme with competitive ratio O(log3n), which is much simpler than the original proof from [11].
- J. Aspens, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proc. of the 25th ACM Symp. on Theory of Computing (STOC), pages 623--631, 1993. Google Scholar
Digital Library
- Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291--301, 1998. Google ScholarDigital Library
- B. Awerbuch and Y. Azar. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation. In Proc. of the 35th IEEE Symp. on Foundations of Computer Science (FOCS), pages 240--249, 1994.Google ScholarDigital Library
- Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke. Optimal oblivious routing in polynomial time. In Proc. of the 35th ACM Symp. on Theory of Computing (STOC), 2003. to appear. Google ScholarDigital Library
- A. Borodin and J. Hopcroft. Routing, merging and sorting on parallel models of computation. Journal of Computer and System Sciences, 30(1):130--145, 1985. Google ScholarDigital Library
- C. Harrelson, K. Hildrum, and S. Rao. A polynomial-time tree decomposition to minimize congestion. These proceedings, 2003. Google ScholarDigital Library
- C. Kaklamanis, D. Krizanc, and A. Tsantilas. Tight bounds for oblivious routing in the hypercube. In Proc. of the 2nd ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 31--36, 1990. Google ScholarDigital Library
- P. Klein, S. A. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In Proc. of the 25th ACM Symp. on Theory of Computing (STOC), pages 682--690, 1993. Google ScholarDigital Library
- B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann. Exploiting locality for networks of limited bandwidth. In Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS), pages 284--293, 1997. Google ScholarDigital Library
- B. M. Maggs, G. L. Miller, O. Parekh, R. Ravi, and S. L. M. Woo. Solving symmetric diagonally-dominant systems by preconditioning. manuscript, 2003.Google Scholar
- H. Räcke. Minimizing congestion in general networks. In Proc. of the 43th IEEE Symp. on Foundations of Computer Science (FOCS), pages 43--52, 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, 1981. Google ScholarDigital Library
- L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proc. of the 13th ACM Symp. on Theory of Computing (STOC), pages 263--277, 1981. Google ScholarDigital Library
Index Terms
- A practical algorithm for constructing oblivious routing schemes
Recommendations
Compact routing schemes
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesWe describe several compact routing schemes for general weighted undirected networks. Our schemes are simple and easy to implement. The routing tables stored at the nodes of the network are all very small. The headers attached to the routed messages, ...
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 ...
Semi-oblivious routing: lower bounds
SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithmsWe initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by Räcke and led to many subsequent improvements and applications. In semi-oblivious routing like oblivious routing, the algorithm should select ...
Comments