Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
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
Brief announcement: chasing the weakest system model for implementing Ω and consensus
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Ω meets paxos: leader election and stability without eventual timely links
DISC'05 Proceedings of the 19th international conference on Distributed Computing
A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Quiescence of self-stabilizing gossiping among mobile agents in graphs
Theoretical Computer Science
Algorithms and theory of computation handbook
Low communication self-stabilization through randomization
DISC'10 Proceedings of the 24th international conference on Distributed computing
Silence is golden: self-stabilizing protocols communication-efficient after convergence
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Specifying and implementing an eventual leader service for dynamic systems
International Journal of Web and Grid Services
A super-stabilizing log(n)-approximation algorithm for dynamic Steiner trees
Theoretical Computer Science
| Hi-index | 0.00 |
We mix two approaches of the fault-tolerance: robustness and stabilization. Using these approaches, we propose leader election algorithms that tolerate both transient and crash failures. Our goal is to show the implementability of the robust self- and/or pseudo- stabilizing leader election in various systems with weak reliability and synchrony assumptions. We try to propose, when it is possible, communicationefficient implementations. Also, we exhibit some assumptions required to obtain robust stabilizing leader election algorithms. Our results show that the gap between robustness and stabilizing robustness is not really significant when we consider fix-point problems such as leader election.