Skip to main content
SpringerLink
Log in

Time optimal self-stabilizing spanning tree algorithms

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 761))

Abstract

In this paper we present time-optimal self-stabilizing algorithms for asynchronous distributed spanning tree computation in networks. We present both a randomized algorithm for anonymous networks as well as a deterministic version for ID-based networks. Our protocols are the first to be time-optimal (i.e. stabilize in time O(diameter)) without any prior knowledge of the network size or diameter, assuming we are allowed messages of size O(ID). Both results are achieved through a new technique of symmetry breaking that may be of independent interest.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anish Arora and Mohamed G. Gouda. Distributed reset. In Proc. 10th Conf. on Foundations of Software Technology and Theoretical Computer Science, pages 316–331. Spinger-Verlag (LNCS 472), 1990.

    Google Scholar 

  2. Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, and George Varghese. Time Optimal Self-Stabilizing Synchronization. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, May 1993.

    Google Scholar 

  3. Yehuda Afek, Shay Kutten, and Moti Yung. Memory-efficient self-stabilization on general networks. In Proc. 4th Workshop on Distributed Algorithms, Italy, September 1990.

    Google Scholar 

  4. Yehuda Afek and Yossi Matias. Simple and Efficient Election Algorithms for Anonymous Networks. In 3rd International Workshop on Distributed Algorithms, Nice, France, September 1989.

    Google Scholar 

  5. Dana Angluin. Local and global properties in networks of processes. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, May 1980.

    Google Scholar 

  6. Baruch Awerbuch, Boaz Patt-Shamir, and George Varghese. Self-stabilization by local checking and correction. In 32nd Annual Symposium on Foundations of Computer Science, pages 268–277, October 1991.

    Google Scholar 

  7. Baruch Awerbuch and George Varghese. Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In 32nd Annual Symposium on Foundations of Computer Science, pages 258–267, October 1991.

    Google Scholar 

  8. Edsger W. Dijkstra. Self stabilization in spite of distributed control. Comm. ACM, 17:643–644, 1974.

    Google Scholar 

  9. Shlomi Dolev, Amos Israeli, and Shlomo Moran. Uniform self-stabilizing leader election. In Proc. 5th Workshop on Distributed Algorithms, pages 167–180, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIT Laboratory for Computer Science, USA

    Sudhanshu Aggarwal

  2. IBM T.J. Watson Research Center, USA

    Sudhanshu Aggarwal & Shay Kutten

Authors
  1. Sudhanshu Aggarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shay Kutten
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rudrapatna K. Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aggarwal, S., Kutten, S. (1993). Time optimal self-stabilizing spanning tree algorithms. In: Shyamasundar, R.K. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1993. Lecture Notes in Computer Science, vol 761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57529-4_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-57529-4_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57529-0

  • Online ISBN: 978-3-540-48211-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation