Fault-local distributed mending (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
An exercise in fault-containment: self-stabilizing leader election
Information Processing Letters
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Optimal reactive k-stabilization: the case of mutual exclusion
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Stabilizing time-adaptive protocols
Theoretical Computer Science
Fault-containing network protocols
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
The Theory of Weak Stabilization
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Weak vs. Self vs. Probabilistic Stabilization
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
A 1-strong self-stabilizing transformer
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Probabilistic fault-containment
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
This paper presents an exercise in fault-containment on a weakly-stabilizing system. The exercise uses the weakly stabilizing leader election algorithm in [3], and shows how the effect of single faults can be contained both in space and in time. Our algorithm confines the effect of any single fault to the constant-distance neighborhood of the faulty process, and the contamination number is restricted to 4 with high probability for an array of processes. We also show that the expected recovery time from a single fault is independent of the array size, i.e., the solution is fault-containing in time too.