Years and Authors of Summarized Original Work
-
1988; Leighton, Maggs, Rao
Problem Definition
A collection of packets need to be routed from a set of specified sources to a set of specified destinations in an arbitrary network. Leighton, Maggs and Rao [5] looked at a model where this task is divided into two separate tasks: the first is the path selection task, where for each specified packet i with source s i and packet destination t i , a simple (meaning edges don't repeat) path P i through the network from s i to t i is pre-selected. Packets traverse the network in a store and forwardmanner: each time a packet is forwarded it travels along the next link in the pre-selected path. It is assumed that only one packet can cross each individual link at each given global (synchronous) timestep. Thus, when there is contention for a link, packets awaiting traversal are stored in the local link's queue (special source and sink queues of unbounded size are also defined that store packets at...
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
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
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
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
Goldberg LA, Patterson M, Srinivasan A, Sweedick E (2001) Better approximation guarantees for job-shop scheduling. SIAM J Discret Math 14(1):67–92
Leighton FT, Maggs BM, Rao SB (1994) Packet routing and jobs-hop scheduling in O(congestion+dilation) steps. Combinatorica 14(2):167–180
Leighton FT, Maggs BM, Richa AW (1999) Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica 19(3):375–401
Meyer auf der Heide F, Vöcking B (1999) Shortest-path routing in arbitrary networks. J Algorithms 31(1):105–131
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
Rabani Y, Tardos E (1996) Distributed packet switching in arbitrary networks. In: The 28th ACM symposium on theory of computing, pp 366–376
Scheideler C (1998) Universal routing strategies for interconnection networks, vol 1390, Lecture Notes in Computer Science. Springer
Shmoys DB, Stein C, Wein J (1994) Improved approximation algorithms for shop scheduling problems. SIAM J Comput 23(3):617–632
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-1-4939-2864-4_273
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