Skip to main content
SpringerLink
Log in

Packet Routing

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 103 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Andrews M, Zhang L (2005) Hardness of the undirected congestion minimization problem. In: Proceedings of the 37th annual ACM symposium on theory of computing, pp 284–293

    Google Scholar 

  2. Chuzhoy J, Naor J (2004) New hardness results for congestion minimization and machine scheduling. In: Proceedings of the 36th annual ACM symposium on theory of computing. ACM, New York, pp 28–34

    Google Scholar 

  3. Erdös P, Lovász L (1975) Problems and results on 3-chromatic hypergraphs and some related questions. Colloq Math Soc János Bolyai 10:609–627

    MathSciNet  MATH  Google Scholar 

  4. Goldberg LA, Patterson M, Srinivasan A, Sweedick E (2001) Better approximation guarantees for job-shop scheduling. SIAM J Discret Math 14(1):67–92

    Article  MathSciNet  MATH  Google Scholar 

  5. Leighton FT, Maggs BM, Rao SB (1994) Packet routing and jobs-hop scheduling in O(congestion+dilation) steps. Combinatorica 14(2):167–180

    Article  MathSciNet  MATH  Google Scholar 

  6. Leighton FT, Maggs BM, Richa AW (1999) Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica 19(3):375–401

    Article  MathSciNet  MATH  Google Scholar 

  7. Meyer auf der Heide F, Vöcking B (1999) Shortest-path routing in arbitrary networks. J Algorithms 31(1):105–131

    Article  MathSciNet  MATH  Google Scholar 

  8. Ostrovsky R, Rabani Y (1997) Universal O (congestion + dilation + log1+εN) local control packet switching algorithm. In: Proceedings of the twenty-ninth ACM symposium on theory of computing, pp 644–653

    Google Scholar 

  9. Rabani Y, Tardos E (1996) Distributed packet switching in arbitrary networks. In: The 28th ACM symposium on theory of computing, pp 366–376

    Google Scholar 

  10. Scheideler C (1998) Universal routing strategies for interconnection networks, vol 1390, Lecture Notes in Computer Science. Springer

    MATH  Google Scholar 

  11. Shmoys DB, Stein C, Wein J (1994) Improved approximation algorithms for shop scheduling problems. SIAM J Comput 23(3):617–632

    Article  MathSciNet  MATH  Google Scholar 

  12. Srinivasan A, Teo CP (2000) A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria. SIAM J Comput 30(6):2051–2068

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Tufts University, Medford, MA, USA

    Lenore J. Cowen

Authors
  1. Lenore J. Cowen
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Cowen, L.J. (2016). Packet Routing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_273

Download citation

Publish with us

Policies and ethics

Search

Navigation