Years and Authors of Summarized Original Work
2006; Busch, Magdon-Ismail, Mavronicolas, Spirakis
Problem Definition
The performance of a communication network is affected by the packet collisions which occur when two or more packets appear simultaneously in the same network node (router) and all these packets wish to follow the same outgoing link from the node. Since network links have limited available bandwidth, the collided packets wait on buffers until the collisions are resolved. Collisions cause delays in the packet delivery time and also contribute to the network performance degradation.
Direct routingis a packet delivery method which avoids packet collisions in the network. In direct routing, after a packet is injected into the network it follows a path to its destination without colliding with other packets, and thus without delays due to buffering, until the packet is absorbed at its destination node. The only delay that a packet experiences is at the source node while it...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Adler M, Khanna S, Rajaraman R, Rosén A (2003) Timeconstrained scheduling of weighted packets on trees and meshes. Algorithmica 36:123–152
Alon N, Chung F, Graham R (1994) Routing permutations on graphs via matching. SIAM J Discret Math 7(3):513–530
Alstrup S, Holm J, de Lichtenberg K, Thorup M (1998) Direct routing on trees. In: Proceedings of the ninth annual ACM-SIAM, symposium on discrete algorithms (SODA 98), San Francisco, pp 342–349
Ben-Dor A, Halevi S, Schuster A (1998) Potential function analysis of greedy hot-potato routing. Theory Comput Syst 31(1):41–61
Busch C, Herlihy M, Wattenhofer R (2000) Hard-potato routing. In: Proceedings of the 32nd annual ACM symposium on theory of computing, Portland, pp 278–285
Busch C, Magdon-Ismail M, Mavronicolas M, Spirakis P (2006) Direct routing: algorithms and complexity. Algorithmica 45(1):45–68
Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking, B (1996) Universal algorithms for store-and-forward and wormhole routing. In: Proceedings of the 28th ACM symposium on theory of computing, Philadelphia, pp 356–365
Feige U, Raghavan P (1992) Exact analysis of hot-potato routing. In: IEEE (ed) Proceedings of the 33rd annual, symposium on foundations of computer science, Pittsburgh, pp 553–562
Kaklamanis C, Krizanc D, Rao S (1993) Hot-potato routing on processor arrays. In: Proceedings of the 5th annual ACM, symposium on parallel algorithms and architectures, Velen, pp 273–282
Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays – trees – hypercubes. Morgan Kaufmann, San Mateo
Leighton FT, Maggs BM, Rao SB (1994) Packet routing and jobscheduling in O(congestion+dilation) steps. Combinatorica 14:167–186
Leighton T, Maggs B, Richa AW (1999) Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica 19:375–401
Symvonis A (1996) Routing on trees. Inf Process Lett 57(4):215–223
Valiant LG (1982) A scheme for fast parallel communication. SIAM J Comput 11:350–361
Valiant LG, Brebner GJ (1981) Universal schemes for parallel communication. In: Proceedings of the 13th annual ACM, symposium on theory of computing, Milwaukee, pp 263–277
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
Busch, C. (2016). Direct Routing Algorithms. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_113
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_113
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