Abstract
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within poly-logarithmic factors from optimal). Both algorithms are distributed and greedy; so, routing decisions are made locally, and packets are advanced towards their destinations whenever possible. © Springer-Verlag 2004.
Cite
CITATION STYLE
Busch, C., Magdon-Ismail, M., Mavronicolas, M., & Wattenhofer, R. (2004). Near-optimal hot-potato routing on trees. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3149, 820–827. https://doi.org/10.1007/978-3-540-27866-5_109
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
