Abstract
The switches and routers of large scale networks cannot manage a state per user session. The burden of memory management would overwhelm the network. Therefore, it is important to find distributed network algorithms which hold a state only at the initiating node. Termination detection algorithms are particularly interesting, since they can be used in the implementation of other stateless algorithms.
The importance of stateless termination detection is apparent in mulit-cast trees. Multicast trees are commonly used to multicast messages across the network. In many cases the mulitcast message represents a request sent from the root node that must be answered by all the leaves of the tree. In most networks the leaves could send their answer directly to the root. Unfortunately, the root would have no way of knowing when all the leaves answered the request. Broadcast-echo algorithms are often used in this case, but these algorithms require a state in the internal nodes of the mulitcast tree. Nack oriented protocols are also common, particularly in reliable multicast implementations. These algorithms are optimized for continues downstream information from the source to the destinations rather than for transactional request-reply operations.
We present a simple algorithm for termination detection in trees and DAGs which does not require managing a state in the nodes of the graph. The algorithm works even if the graph changes during the execution. For a tree with n nodes, the number of bits added to each message is O (log n). We also discuss how this algorithm may be used in general graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
David L. Tennenhouse, Jonathan M. Smith, W. David Sincoskie, David J. Wetherall, and Gary J. Minden. A survey of active network research. IEEE Communications Magazine, 35(1):80–86, 1997.
E. Dijkstra and B. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1–4, 1980.
Nir Shavit and Nissim Francez. A new approach to detection of locally indicative stability. In Automata, Languages and Programming, pages 344–358, 1986.
Gerard Tel. Introduction to Distributed Algorithms. Cambridge Uni Press, Cambridge, 1994.
E. Dijkstra, W. Feijen, and A Gasteren. Derivation of a termination detection algorithm for distributed computations. In Inf. Proc. Lett. 16, 5, pages 217–219, 1983.
E. Dijkstra. Shmuel safra’s version of termination detection. Technical Report EWD998, The University of Texas at Austin, 1987.
Donald F. Towsley, James F. Kurose, and Sridhar Pingali. A comparison of sender-initiated and receiver-initiated reliable multicast protocols. IEEE Journal of Selected Areas in Communications, 15(3):398–406, 1997.
Brian Neil Levine and J. J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems, 6(5):334–348, 1998.
Eric W. Weisstein. Binary tree. http://mathworld.wolfram.com/.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stupp, G. (2002). Stateless Termination Detection. In: Malkhi, D. (eds) Distributed Computing. DISC 2002. Lecture Notes in Computer Science, vol 2508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36108-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-36108-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00073-0
Online ISBN: 978-3-540-36108-4
eBook Packages: Springer Book Archive