Abstract
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tree in a distributed fashion for a completely connected topology. Our algorithm requires a node to process O(1) messages of size O(log n) on average in one cycle as compared to previous algorithms which need to process messages from every neighbor, resulting in O(n) work in a completely connected topology. Our algorithm also stabilizes faster than the previous approaches.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Afek, Y., Kutten, S., Yung, M.: Memory-efficient self stabilizing protocols for general networks. In: Proc. of the 4th Int’l Workshop on Distributed Algorithms, pp. 15–28. Springer, Heidelberg (1991)
Aggarwal, S., Kutten, S.: Time optimal self-stabilizing spanning tree algorithm. In: Proc. of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 400–410 (1993)
Antonoiu, G., Srimani, P.: Distributed self-stabilizing algorithm for minimum spanning tree construction. In: European Conference on Parallel Processing, pp. 480–487 (1997)
Arora, A., Gouda, M.: Distributed reset. IEEE Transactions on Computers 43(9), 1026–1038 (1994)
Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction (extended abstract). In: IEEE Symposium on Foundations of Computer Science, pp. 268–277 (1991)
Collin, Z., Dolev, S.: Self-stabilizing depth-first search. Information Processing Letters 49(6), 297–301 (1994)
Deo, N., Micikevicius, P.: Prufer-like codes for labeled trees. Congressus Numerantium 151, 65–73 (2001)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17, 643–644 (1974)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems. In: MCC Workshop on Self-Stabilizing Systems (1989)
Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. In: Proc. of the ninth annual ACM symposium on Principles of Distributed Computing, pp. 103–117. ACM Press, New York (1990)
Dolev, S., Israeli, A., Moran, S.: Uniform self-stabilizing leader election. In: Proc. of the 5th Workshop on Distributed Algorithms, pp. 167–180 (1991)
Gaertner, F.C.: A survey of self-stabilizing spanning-tree construction algorithms. Technical report, EPFL (October 2003)
Garg, V.K., Agarwal, A.: Self-stabilizing spanning tree algorithm with a new design methodology. Technical report, University of Texas at Austin (2004), Available as http://maple.ece.utexas.edu/TechReports/2004/TR-PDS-2004-001.ps
Huang, S., Chen, N.: A self stabilizing algorithm for constructing breadth first trees. Information Processing Letters 41, 109–117 (1992)
Johnen, C.: Memory efficient, self-stabilizing algorithm to construct bfs spanning trees. In: Proc. of the sixteenth annual ACM symposium on Principles of Distributed Computing, p. 288. ACM Press, New York (1997)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
Neville, E.H.: The codifying of tree-structure. Proceedings of Cambridge Philosophical Society 49, 381–385 (1953)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garg, V.K., Agarwal, A. (2005). Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_68
Download citation
DOI: https://doi.org/10.1007/11549468_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)