Advertisement

A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves

  • Adrian Kosowski
  • Łukasz Kuszner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3911)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Arora, A., Gouda, M.: Distributed reset. IEEE Transactions on Computers 43, 1026–1038 (1994)CrossRefzbMATHGoogle Scholar
  4. 4.
    Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communication of the ACM 17, 643–644 (1974)CrossRefzbMATHGoogle Scholar
  5. 5.
    Dolev, S., Gouda, M., Schneider, M.: Memory requirements for silent stabilization. Acta Informatica 36, 447–462 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic system assuming only read/write atomicity. Distributed Computing 7, 3–16 (1993)CrossRefzbMATHGoogle Scholar
  7. 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
  8. 8.
    Huang, S., Chen, N.: A self-stabilizing algorithm for constructing breadth-first trees. Inform. Process. Lett. 41, 109–117 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 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
  10. 10.
    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)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Adrian Kosowski
    • 1
  • Łukasz Kuszner
    • 1
  1. 1.Department of Algorithms and System ModelingGdańsk University of TechnologyPoland

Personalised recommendations