Skip to main content
SpringerLink
Log in

Optimal time self stabilization in dynamic systems

Preliminary version

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1993)

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

Included in the following conference series:

Abstract

A self-stabilizing system is a distributed system which can tolerate any number and any type of faults in the history. After the last fault occurs the system starts to converge to a legitimate behavior. The self-stabilization property is very useful for systems in which processors may malfunction for a while and then recover. When there is a long enough period during which no processor malfunctions the system stabilizes.

Dynamic systems are systems in which communication links and processors may fail and recover during normal operation. Such failures could cause partitioning of the system communication graph. The application of self-stabilizing protocols to dynamic systems is natural. Following the last topology change each connected component of the system stabilizes independently.

We present time optimal self-stabilizing dynamic protocols for a variety of tasks including: routing, leader election and topology update. The protocol for each of those tasks stabilizes in Θ(d) time, where d is the actual diameter of the system.

This work was supported by NSF Presidential Young Investigator Award CCR-91-58478 and funds from the Texas A&M University College of Engineering.

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. E. Anagnostou, R. El-Yaniv and Vassos Hadzilacos, “Memory Adaptive Self-Stabilizing Protocols”, Proceedings of the 6th International Workshop on Distributed Algorithms, Haifa Israel, 1992.

    Google Scholar 

  2. Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir and George Varghese, “Time Optimal Self-Stabilizing Synchronization”, To appear in STOC-93.

    Google Scholar 

  3. Baruch Awerbuch and George Varghese, “Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols”, FOCS-91.

    Google Scholar 

  4. Richard Bellman. On a routing problem. Quarterly of Applied Mathematics, 16(1):87–90,1958.

    Google Scholar 

  5. G.M. Brown, M.G. Gouda, and C.L. Wu, “Token System that Self-Stabilize”, IEEE Transactions on Computers, Vol. 38, No. 6, June 1989, pp. 845–852.

    Google Scholar 

  6. J.E. Burns and J. Pachl, “Uniform Self-Stabilizing Rings”, Aegean Workshop On Computing, 1988, Lecture Notes in Computer Science 319, pp. 391–400.

    Google Scholar 

  7. E.W. Dijkstra, “Self-Stabilizing Systems in Spite of Distributed Control”, Communications of the ACM 17,11 (1974), pp. 643–644.

    Google Scholar 

  8. S. Dolev, A. Israeli and S. Moran, “Self Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity”, Proc. of the Ninth Annual ACM Symposium on Principles of Distributed Computation, Montreal, August 1990, pp. 103–117.

    Google Scholar 

  9. S. Dolev, A. Israeli and S. Moran, “Resource Bounds for Self Stabilizing Message Driven Protocols”, Proc. of the Tenth Annual ACM Symposium on Principles of Distributed Computation, Montreal, August 1991, pp. 281–294.

    Google Scholar 

  10. S. Dolev, A. Israeli and S. Moran, “Uniform Dynamic Self-Stabilizing Leader Election”, in Lecture Notes in Computer Science 579: Distributed Algorithms, (Proc. of the 5th International Workshop on Distributed Algorithms, Delphi, Greece, October 1991), S. Toueg, P.G. Spirakis and L. Kirousis, Editors, pp. 163–180, Springer Verlag, 1992.

    Google Scholar 

  11. S. Katz and K. J. Perry, “Self-stabilizing extensions for message-passing systems”, Proc. of the Ninth Annual ACM Symposium on Principles of Distributed Computation, Montreal, August 1990, pp. 91–101.

    Google Scholar 

  12. H.S.M. Kruijer, “Self-stabilization (in spite of distributed control) in trees-tructured systems”, Information Processing Letters 8,2 (1979), pp. 91–95.

    Google Scholar 

  13. L. Lamport, “The Mutual Exclusion Problem: Part II — Statement and Solutions”, Journal of the Association for Computing Machinery, Vol. 33 No. 2 (1986), pp. 327–348.

    Google Scholar 

  14. J. Spinelli and R.G. Gallager, “Event Driven Topology Broadcast Without Sequence Numbers”, IEEE Transactions on Communication, Vol. 37, No. 5, (1989) pp. 468–474.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Texas A&M University, 77843, College Station, Texas

    Shlomi Dolev

Authors
  1. Shlomi Dolev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

André Schiper

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dolev, S. (1993). Optimal time self stabilization in dynamic systems. In: Schiper, A. (eds) Distributed Algorithms. WDAG 1993. Lecture Notes in Computer Science, vol 725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57271-6_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-57271-6_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57271-8

  • Online ISBN: 978-3-540-48029-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation