Skip to main content
Springer Nature Link
Log in

Routing

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 166 Accesses

Years and Authors of Summarized Original Work

  • 2003; Azar, Cohen, Fiat, Kaplan, Räcke

Problem Definition

One of the most often used techniques in modern computer networks is routing. Routing means selecting paths in a network along which to send data. Demands usually randomly appear on the nodes of a network, and routing algorithms should be able to send data to their destination. The transfer is done through intermediate nodes, using the connecting links, based on the topology of the network. The user waits for the network to guarantee that it has the required capacity during data transfer, meaning that the network behaves like its nodes would be connected directly by a physical line. Such service is usually called the permanent virtual circuit (PVC) service. To model real life situations, assume that demands arrive on line, given by source and destination points, and capacity (bandwidth) requirements.

Similar routing problems may occur in other environments, for example in parallel...

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Applegate D, Cohen E (2006) Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Trans Networking 14(6):1193–1206. doi:10.1109/TNET.2006.886296

    Article  Google Scholar 

  2. Aspnes J, Azar Y, Fiat A, Plotkin S, Waarts O (1997) On-line routing of virtual circuits with applications to load balancing and machine scheduling. J ACM 44(3):486–504

    Article  MathSciNet  MATH  Google Scholar 

  3. Azar Y, Chaiutin Y (2006) Optimal node routing. In: Proceedings of the 23rd international symposium on theoretical aspects of computer science, pp 596–607

    Google Scholar 

  4. Azar Y, Cohen E, Fiat A, Kaplan H, Räcke H (2003) Optimal oblivious routing in polynomial time. In: Proceedings of the thirty-fifth annual ACM symposium on theory of computing, pp 383–388

    Google Scholar 

  5. Bansal N, Blum A, Chawla S, Meyerson A (2003) Online oblivious routing. In: Proceedings of the 15th annual ACM symposium on parallel algorithms, pp 44–49

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Hajiaghayi MT, Kleinberg RD, Leighton T, Räcke H (2005) Oblivious routing on node-capacitated and directed graphs. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms, pp 782–790

    Google Scholar 

  8. Hajiaghayi MT, Kim JH, Leighton T, Räcke H (2005) Oblivious routing in directed graphs with random demands. In: Proceedings of the 37th annual ACM symposium on theory of computing, pp 193–201

    Google Scholar 

  9. Kaklamanis C, Krizanc D, Tsantilas A (1990) Tight bounds for oblivious routing in the hypercube. In: Proceedings of the 2nd annual ACM symposium on parallel algorithms and architectures, pp 31–36

    Google Scholar 

  10. Leighton FT (1992) Introduction to parallel algorithms and architectures arrays, trees, hypercubes. Morgan Kaufmann Publishers, San Fransisco

    MATH  Google Scholar 

  11. Leonardi S (1998) On-line network routing, Chapter 11. In: Fiat A, Woeginger G (eds) Online algorithms – the state of the art. Springer, Heidelberg, pp 242–267

    Chapter  Google Scholar 

  12. Räcke H (2002) Minimizing congestions in general networks. In: Proceedings of the 43rd symposium on foundations of computer science, pp 43–52

    Google Scholar 

  13. Raghavan P, Thompson CD (1987) Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7:365–374

    Article  MathSciNet  MATH  Google Scholar 

  14. Spring N, Mahajan R, Wetherall D (2002) Measuring ISP topologies with Rocket fuel. In: Proceedings of the ACMSIGCOMM'02 conference. ACM, New York

    Google Scholar 

  15. Valiant LG, Brebner G (1981) Universal schemes for parallel communication. In: Proceedings of the 13th ACM symposium on theory of computing, pp 263–277

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Juhász Gyula Teachers Training College, Szeged, Hungary

    József Békési & Gábor Galambos

Authors
  1. József Békési
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gábor Galambos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to József Békési .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Békési, J., Galambos, G. (2016). Routing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_351

Download citation

Publish with us

Policies and ethics