Years and Authors of Summarized Original Work
-
2002; Räcke
Problem Definition
Consider a communication network, for example, the network of cities across the country connected by communication links. There are several sender-receiver pairs on this network that wish to communicate by sending traffic across the network. The problem deals with routing all the traffic across the network such that no link in the network is overly congested. That is, no link in the network should carry too much traffic relative to its capacity. The obliviousness refers to the requirement that the routes in the network must be designed without the knowledge of the actual traffic demands that arise in the network, i.e., the route for every sender-receiver pair stays fixed irrespective of how much traffic any pair chooses to send. Designing a good oblivious routing strategy is useful since it ensures that the network is robust to changes in the traffic pattern.
Notations
Let G = (V, E) be an undirected graph...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Alon N, Awerbuch B, Azar Y, Buchbinder N, Naor J (2004) A general approach to online network optimization problems. In: Symposium on discrete algorithms, pp 570–579
Applegate D, Cohen E (2003) Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: SIGCOMM, pp 313–324
Aumann Y, Rabani Y (1998) An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J Comput 27(1):291–301
Azar Y, Cohen E, Fiat A, Kaplan H, Räcke H (2003) Optimal oblivious routing in polynomial time. In: Proceedings of the 35th ACM symposium on the theory of computing, pp 383–388
Bansal N, Blum A, Chawla S, Meyerson A (2003) Online oblivious routing. In: Symposium on parallelism in algorithms and architectures, pp 44–49
Borodin A, Hopcroft J (1985) Routing, merging and sorting on parallel models of computation. J Comput Syst Sci 10(1):130–145
Hajiaghayi M, Kim JH, Leighton T, Räcke H (2005) Oblivious routing in directed graphs with random demands. In: Symposium on theory of computing, pp 193–201
Hajiaghayi M, Kleinberg R, Leighton T (2007) Semi-oblivious routing: lower bounds. In: Proceedings of the 18th ACM-SIAM symposium on discrete algorithms, pp 929–938
Harrelson C, Hildrum K, Rao S (2003) A polynomial-time tree decomposition to minimize congestion. In: Proceedings of the 15th annual ACM symposium on parallel algorithms and architectures, pp 34–43
Kaklamanis C, Krizanc D, Tsantilas T (1991) Tight bounds for oblivious routing in the hypercube. In: Proceedings of the 3rd annual ACM symposium on parallel algorithms and architectures, pp 31–36
Räcke H (2002) Minimizing congestion in general networks. In: Proceedings of the 43rd annual symposium on the foundations of computer science, pp 43–52
Räcke H (2008) Optimal hierarchical decompositions for congestion minimization networks. In: Symposium on theory of computing, pp 255–264
Valiant L, Brebner GJ (1981) Universal schemes for parallel communication. In: Proceedings of the 13th ACM symposium on theory of computing, pp 263–277
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Bansal, N. (2016). Oblivious Routing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_261
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_261
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering