A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
IEEE Transactions on Software Engineering
A self-stabilizing algorithm for maximal matching
Information Processing Letters
ACM Computing Surveys (CSUR)
A self-stabilizing algorithm for coloring bipartite graphs
Information Sciences: an International Journal
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
Fault-containing network protocols
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Self-stabilization
Fault-containing self-stabilization using priority scheduling
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-Stabilizing Neighborhood Synchronizer in Tree Networks
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
An Efficient Fault-Containing Self-Stabilizing Algorithm for Finding a Maximal Independent Set
IEEE Transactions on Parallel and Distributed Systems
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing depth-first token circulation on networks
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing population protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
Preserving the Fault-Containment of Ring Protocols Executed on Trees
The Computer Journal
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
Request-based token passing for self-stabilizing mutual exclusion
Information Sciences: an International Journal
Hi-index | 0.07 |
One of the desired properties of distributed systems is self-adaptability against faults. Self-stabilizing protocols provide autonomous recovery from any finite number of transient faults. However, in practice, catastrophic faults rarely occur, while small-scale faults are more likely to occur. Fault-containing self-stabilizing protocols promise not only self-stabilization but also containment of the effect of small-scale faults, i.e., they promise quick recovery and small effect for small-scale faults. Hierarchical composition of self-stabilizing protocols is expected to ease the design of new self-stabilizing protocols. However, existing composition techniques for self-stabilizing protocols cannot preserve the fault-containment property of source protocols. In this paper, we propose a novel timer-based hierarchical composition of fault-containing self-stabilizing protocols that preserves the fault-containment property of source protocols. To implement timers, we propose a local neighborhood synchronizer that synchronizes limited number of processes during a short time after a fault without involving the entire network into the synchronization. The proposed composition technique facilitates the design of new fault-containing self-stabilizing protocols and enhances the reusability of existing fault-containing self-stabilizing protocols.