Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
On FTSS-solvable distributed problems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Tolerating Transient and Permanent Failures (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Optimal Implementation of the Weakest Failure Detector for Solving Consensus
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Stabilization and pseudo-stabilization
Distributed Computing - Special issue: Self-stabilization
Consensus with Byzantine Failures and Little System Synchrony
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
| Hi-index | 0.02 |
This article deals with stabilization and fault-tolerance. We consider two types of stabilization: the self- and pseudo-stabilization. Our goal is to implement the self- and/or pseudo-stabilizing leader election in systems with process crashes, weak reliability, and synchrony assumptions. We try to propose, when it is possible, communication-efficient implementations. Our approach allows to obtain algorithms that tolerate both transient and crash failures. Note that some of our solutions are adapted from existing fault-tolerant algorithms. The motivation here is not to propose new algorithms but merely to show some assumptions required to obtain stabilizing leader elections in systems with crash failures. In particular, we focus on the borderline assumptions where we go from the possibility to have self-stabilizing solutions to the possibility to only have pseudo-stabilizing ones.