Tolerating transient and permanent failures (extended abstract)

  • Efthymios Anagnostou
  • Vassos Hadzilacos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 725)


We investigate the possibility of designing protocols that are both self-stabilizing and fault-tolerant, in the asynchronous model of distributed systems. We prove that no such protocols exist for a wide range of problems, including determining (even approximately) the size of the distributed system and leader election. All of these problems are solvable in asynchronous systems using (randomized) protocols that are only fault-tolerant (but not self-stabilizing); or only self-stabilizing (but not fault-tolerant). We then focus on the problem of computing distinct names for the processors in a ring. We give three (randomized) protocols that solve this problem in three settings satisfying increasingly weak assumptions: When processors know the exact size n of the ring; when they only know an upper bound on n; and when they have no information about n.


Distributed Algorithms Self-Stabilization Fault-Tolerance Asynchrony Rings 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AE91]
    E. Anagnostou and R. El-Yaniv. More on the Power of Random Walks: Uniform, Bounded Self-Stabilizing Protocols. In 5th IWDAG, pages 31–51, Delphi, Greece, 1991.Google Scholar
  2. [AEH92]
    E. Anagnostou, R. El-Yaniv, and V. Hadzilacos. Memory Adaptive Self-Stabilizing Protocols. In 6th IWDAG, pages 203–220, Haifa, Israel, 1992.Google Scholar
  3. [AFL83]
    E. Arjomandi, M. Fisher, and N. Lynch. Efficiency of Synchronous Versus Asynchronous Distributed Systems. Journal of the ACM, 30 (3):449–456, 1983.Google Scholar
  4. [AG90]
    A. Arora and M. Gouda. Distributed Reset (Extended Abstract). In Tenth Conference on FSTCS, pages 316–329, Bangalore, India, 1990.Google Scholar
  5. [AKY90]
    Y. Afek, S. Kutten, and M. Yung. Memory-Efficient Self Stabilizing Protocols for General Networks. In 4th IWDAG, pages 15–28, Bari, Italy, 1990.Google Scholar
  6. [AV91]
    B. Awerbuch and G. Varghese. Distributed Program Checking: a Paradigm for Building Self-Stabilizing Distributed Protocols. In 32nd FOCS, October, 1991.Google Scholar
  7. [Dij74]
    E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Comm. of the ACM, 17(11):643–644, 1974.Google Scholar
  8. [DIM90]
    S. Dolev, A Israeli, and S. Moran. Self Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. In 9th PODC, pages 103–117, Quebec City, Canada, 1990.Google Scholar
  9. [DIM91]
    S. Dolev, A. Israeli, and S. Moran. Uniform Dynamic Self-Stabilizing Leader Election. In 5th IWDAG, pages 167–180, Delphi, Greece, 1991.Google Scholar
  10. [Fis83]
    Michael J. Fischer. The Consensus Problem in Unreliable Distributed Systems (a Brief Survey). Technical Report 273, Department of Computer Science, Yale University, June 1983.Google Scholar
  11. [GP93]
    A. S. Gopal and K. J. Perry. Unifying Self-Stabilization and Fault-Tolerance. In 12th PODC, Ithaca, New York, 1993.Google Scholar
  12. [HT93]
    V. Hadzilacos and S. Toueg. “Fault-tolerant broadcasts and related problems”, Chapter 5 in Distributed Systems. Addison-Wesley, Sape Mullender (editor), 1993.Google Scholar
  13. [IJ90]
    A. Israeli and M. Jalfon. Token Management Schemes and Random Walks Yield Self Stabilizing Mutual Exclusion. In 9th PODC, pages 119–131, 1990.Google Scholar
  14. [KP90]
    S. Katz and K. J. Perry. Self-stabiling Extensions for Message-passing Systems. In 9th PODC, pages 91–101, Quebec City, Canada, 1990.Google Scholar
  15. [MOOY92]
    A. Mayer, Y. Ofek, R. Ostrovsky, and M. Yung. Self-Stabilizing Symmetry Breaking in Constant-Space. In STOC, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Efthymios Anagnostou
    • 1
  • Vassos Hadzilacos
    • 1
  1. 1.Department of Computer ScienceUniversity of TorontoTorontoCanada

Personalised recommendations