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
Fault-Containment in Weakly-Stabilizing Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Timer-based composition of fault-containing self-stabilizing protocols
Information Sciences: an International Journal
| Hi-index | 0.00 |
Research on fine tuning stabilization properties has received attention for nearly a decade. This paper presents a probabilistic algorithm for fault-containment, that confines the effect of any single fault to the immediate neighborhood of the faulty process, with an expected recovery time of O(Δ3). The most significant aspect of the algorithm is that the fault-gap, defined as the smallest interval after which the system is ready to handle the next single fault with the same efficiency, depends only on Δ, and is independent of the network size. We argue that a small fault-gap increases the availability of the fault-free system.