Distributed Computing

, Volume 13, Issue 1, pp 53–58

Networks on which hot-potato routing does not livelock

  • Uriel Feige
  • Robert Krauthgamer
Original articles

DOI: 10.1007/s004460050005

Cite this article as:
Feige, U. & Krauthgamer, R. Distrib Comput (2000) 13: 53. doi:10.1007/s004460050005

Summary.

Hot-potato routing is a form of synchronous routing which makes no use of buffers at intermediate nodes. Packets must move at every time step, until they reach their destination. If contention prevents a packet from taking its preferred outgoing edge, it is deflected on a different edge. Two simple design principles for hot potato routing algorithms are minimum advance, that advances at least one packet towards its destination from every nonempty node (and possibly deflects all other packets), and maximum advance, that advances the maximum possible number of packets.

Livelock is a situation in which packets keep moving indefinitely in the network without any packet ever reaching its destination. It is known that even maximum advance algorithms might livelock on some networks. We show that minimum advance algorithms never livelock on tree networks, and that maximum advance algorithms never livelock on triangulated networks.

Key words:Hot-potato packet routing – livelock – tree networks – chordal graphs

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Uriel Feige
    • 1
  • Robert Krauthgamer
    • 1
  1. 1.Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel (e-mail: {feige,robi}@wisdom.weizmann.ac.il)IL