Skip to main content
SpringerLink
Log in

Survey on Oblivious Routing Strategies

  • Conference paper
Mathematical Theory and Computational Practice (CiE 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5635))

Included in the following conference series:

Abstract

We give a survey about recent advances in the design of oblivious routing algorithms. These routing algorithms choose their routing paths independent of the traffic in the network and they are therefore very well suited for distributed environments in which no central entitiy exist that could make routing decisions based on the whole traffic pattern in the network.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: A general approach to online network optimization problems. In: Proc. of the 15th SODA, pp. 577–586 (2004)

    Google Scholar 

  2. Azar, Y., Cohen, E., Fiat, A., Kaplan, H., Räcke, H.: Optimal oblivious routing in polynomial time. In: Proc. of the 35th STOC, pp. 383–388 (2003)

    Google Scholar 

  3. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: Proc. of the 37th FOCS, pp. 184–193 (1996)

    Google Scholar 

  4. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proc. of the 30th STOC, pp. 161–168 (1998)

    Google Scholar 

  5. Bartal, Y., Leonardi, S.: On-line routing in all-optical networks. Theor. Comput. Sci. 221(1-2), 19–39 (1999); Also In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 516–526. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  6. Bienkowski, M., Korzeniowski, M., Räcke, H.: A practical algorithm for constructing oblivious routing schemes. In: Proc. of the 15th SPAA, pp. 24–33 (2003)

    Google Scholar 

  7. Borodin, A., Hopcroft, J.E.: Routing, merging and sorting on parallel models of computation. J. Comput. Syst. Sci. 30(1), 130–145 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  8. Busch, C., Magdon-Ismail, M., Xi, J.: Oblivious routing on geometric networks. In: Proc. of the 17th SPAA, pp. 316–324 (2005)

    Google Scholar 

  9. Busch, C., Magdon-Ismail, M., Xi, J.: Optimal oblivious path selection on the mesh. In: Proc. of the 20th IPDPS, pp. 82–91 (2005)

    Google Scholar 

  10. Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.A.: Approximating a finite metric by a small number of tree metrics. In: Proc. of the 39th FOCS, pp. 379–388 (1998)

    Google Scholar 

  11. Chekuri, C., Khanna, S., Shepherd, B.: The all-or-nothing multicommodity flow problem. In: Proc. of the 36th STOC, pp. 156–165 (2004)

    Google Scholar 

  12. Fakcharoenphol, J., Rao, S.B., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proc. of the 35th STOC, pp. 448–455 (2003)

    Google Scholar 

  13. Harrelson, C., Hildrum, K., Rao, S.B.: A polynomial-time tree decomposition to minimize congestion. In: Proc. of the 15th SPAA, pp. 34–43 (2003)

    Google Scholar 

  14. Harsha, P., Hayes, T.P., Narayanan, H., Räcke, H., Radhakrishnan, J.: Minimizing average latency in oblivious routing. In: Proc. of the 19th SODA, pp. 200–207 (2008)

    Google Scholar 

  15. Kaklamanis, C., Krizanc, D., Tsantilas, T.: Tight bounds for oblivious routing in the hypercube. In: Proc. of the 2nd SPAA, pp. 31–36 (1990)

    Google Scholar 

  16. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. J. Algorithms 61(1), 20–44 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Maggs, B.M., Meyer auf der Heide, F., Vöcking, B., Westermann, M.: Exploiting locality for networks of limited bandwidth. In: Proc. of the 38th FOCS, pp. 284–293 (1997)

    Google Scholar 

  18. Maggs, B.M., Miller, G.L., Parekh, O., Ravi, R., Woo, S.L.M.: Finding effective support-tree preconditioners. In: Proc. of the 17th SPAA, pp. 176–185 (2005)

    Google Scholar 

  19. Meyer auf der Heide, F., Vöcking, B.: A packet routing protocol for arbitrary networks. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 291–302. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  20. Ostrovsky, R., Rabani, Y.: Universal \({O}(\mbox{congestion}+\mbox{dilation}+\log^{1+\epsilon} {N})\) local control packet switching algorithms. In: Proc. of the 29th STOC, pp. 644–653 (1997)

    Google Scholar 

  21. Rabin, M.O.: Efficient dispersal of information for security, load balancing and fault tolerance. J. ACM 36, 335–348 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  22. Räcke, H.: Minimizing congestion in general networks. In: Proc. of the 43rd FOCS, pp. 43–52 (2002)

    Google Scholar 

  23. Räcke, H.: Data Management and Routing in General Networks. PhD thesis, Universität Paderborn (2003)

    Google Scholar 

  24. Räcke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proc. of the 40th STOC, pp. 255–264 (2008)

    Google Scholar 

  25. Upfal, E.: Efficient schemes for parallel communication. J. ACM 31(3), 507–517 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  26. Valiant, L.G., Brebner, G.J.: Universal schemes for parallel communication. In: Proc. of the 13th STOC, pp. 263–277 (1981)

    Google Scholar 

  27. Vöcking, B.: Static and Dynamic Data Management in Networks. PhD thesis, Universität Paderborn (December 1998)

    Google Scholar 

  28. Vöcking, B.: Almost optimal permutation routing on hypercubes. In: Proc. of the 33rd STOC, pp. 530–539 (2001)

    Google Scholar 

  29. Westermann, M.: Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. PhD thesis, Universität Paderborn (November 2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Warwick, UK

    Harald Räcke

Authors
  1. Harald Räcke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Heidelberg, Im Neuenheimer Feld 294, 69120, Heidelberg, Germany

    Klaus Ambos-Spies

  2. Universiteit van Amsterdam, Plantage Muidergracht 24, 1018, Amsterdam, TV, The Netherlands

    Benedikt Löwe

  3. Institut für Informatik, Ruprecht-Karls-Universität Heidelberg, Im Neuenheimer Feld 294, 69120, Heidelberg, Germany

    Wolfgang Merkle

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Räcke, H. (2009). Survey on Oblivious Routing Strategies. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03073-4_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03072-7

  • Online ISBN: 978-3-642-03073-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation