Abstract
In the self-stabilizing model each node has only local information about the system. Regardless of the initial state, the system must achieve a desirable global state. We discuss the construction of a solution to the spanning tree problem in this model. To our knowledge we give the first self-stabilizing algorithm working in a polynomial number of moves, without any fairness assumptions. Additionally we show that this approach can be applied under a distributed daemon. We briefly discuss implementation aspects of the proposed algorithm and its application in broadcast routing and in distributed computing.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Afek, Y., Kutten, S., Yung, M.: Memory efficient self-stabilizing protocols for general networks. In: Proceedings of the 4th International Workshop on Distributed Algorithms, pp. 15–28 (1991)
Aggarwal, S., Kutten, S.: Time optimal self-stabilizing spanning tree algorithms. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol. 761, pp. 400–410. Springer, Heidelberg (1993)
Arora, A., Gouda, M.: Distributed reset. IEEE Transactions on Computers 43, 1026–1038 (1994)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communication of the ACM 17, 643–644 (1974)
Dolev, S., Gouda, M., Schneider, M.: Memory requirements for silent stabilization. Acta Informatica 36, 447–462 (1999)
Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic system assuming only read/write atomicity. Distributed Computing 7, 3–16 (1993)
Ghosh, S., Gupta, A., Pemmaraju, S.: A fault-containing self-stabilizing algorithm for spanning trees. Journal of Computing and Information 2, 322–338 (1996)
Huang, S., Chen, N.: A self-stabilizing algorithm for constructing breadth-first trees. Inform. Process. Lett. 41, 109–117 (1992)
Johnen, C.: Memory Efficient, Self-Stabilizing algorithm to construct BFS spanning trees. In: Proc. of the third Workshop on Self-Stabilizing System, pp. 125–140 (1997)
Sur, S., Srimani, P.K.: A self-stabilizing distributed algorithm to construct BFS spanning trees of a symmetric graph. Parallel Process. Lett. 2, 171–179 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kosowski, A., Kuszner, Ł. (2006). A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_10
Download citation
DOI: https://doi.org/10.1007/11752578_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34141-3
Online ISBN: 978-3-540-34142-0
eBook Packages: Computer ScienceComputer Science (R0)