Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
E. Anagnostou, R. El-Yaniv, and V. Hadzilacos. Memory Adaptive Self-Stabilizing Protocols. In 6th IWDAG, pages 203–220, Haifa, Israel, 1992.
E. Arjomandi, M. Fisher, and N. Lynch. Efficiency of Synchronous Versus Asynchronous Distributed Systems. Journal of the ACM, 30 (3):449–456, 1983.
A. Arora and M. Gouda. Distributed Reset (Extended Abstract). In Tenth Conference on FSTCS, pages 316–329, Bangalore, India, 1990.
Y. Afek, S. Kutten, and M. Yung. Memory-Efficient Self Stabilizing Protocols for General Networks. In 4th IWDAG, pages 15–28, Bari, Italy, 1990.
B. Awerbuch and G. Varghese. Distributed Program Checking: a Paradigm for Building Self-Stabilizing Distributed Protocols. In 32nd FOCS, October, 1991.
E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Comm. of the ACM, 17(11):643–644, 1974.
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.
S. Dolev, A. Israeli, and S. Moran. Uniform Dynamic Self-Stabilizing Leader Election. In 5th IWDAG, pages 167–180, Delphi, Greece, 1991.
Michael J. Fischer. The Consensus Problem in Unreliable Distributed Systems (a Brief Survey). Technical Report 273, Department of Computer Science, Yale University, June 1983.
A. S. Gopal and K. J. Perry. Unifying Self-Stabilization and Fault-Tolerance. In 12th PODC, Ithaca, New York, 1993.
V. Hadzilacos and S. Toueg. “Fault-tolerant broadcasts and related problems”, Chapter 5 in Distributed Systems. Addison-Wesley, Sape Mullender (editor), 1993.
A. Israeli and M. Jalfon. Token Management Schemes and Random Walks Yield Self Stabilizing Mutual Exclusion. In 9th PODC, pages 119–131, 1990.
S. Katz and K. J. Perry. Self-stabiling Extensions for Message-passing Systems. In 9th PODC, pages 91–101, Quebec City, Canada, 1990.
A. Mayer, Y. Ofek, R. Ostrovsky, and M. Yung. Self-Stabilizing Symmetry Breaking in Constant-Space. In STOC, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anagnostou, E., Hadzilacos, V. (1993). Tolerating transient and permanent failures (extended abstract). 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_35
Download citation
DOI: https://doi.org/10.1007/3-540-57271-6_35
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