A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves
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.
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 7.Ghosh, S., Gupta, A., Pemmaraju, S.: A fault-containing self-stabilizing algorithm for spanning trees. Journal of Computing and Information 2, 322–338 (1996)Google Scholar
- 9.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)Google Scholar