Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Tolerating transient and intermittent failures
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A stabilizing algorithm for finding biconnected components
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Stabilizing Replicated Search Trees
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Stabilizing Inter-domain Routing in the Internet (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Self-Stabilizing Agent Traversal
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
A Composite Stabilizing Data Structure
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Communication Adaptive Self-Stabilizing Group Membership Service
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks
Journal of Parallel and Distributed Computing
On bootstrapping topology knowledge in anonymous networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
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
Slf-stabiliezing leader election in dynamic networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Loop-free super-stabilizing spanning tree construction
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Space-efficient fault-containment in dynamic networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Adaptive stabilization of reactive protocols
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Towards a theory of self-organization
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Output stability versus time till output
DISC'07 Proceedings of the 21st international conference on Distributed Computing
From self- to self-stabilizing with service guarantee 1-hop weight-based clustering
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 0.00 |
Two aspects of distributed-protocol reliability are the ability to recover from transient faults and the ability to function in a dynamic environment. Approaches for both of these aspects have been separately developed, but have revealed drawbacks when applied to environments with both transient faults and dynamic changes. This paper introduces definitions and methods for addressing both concerns in system design. A protocol is superstabilizing if it is (1) self-stabilizing, meaning that it is guaranteed to respond to an arbitrary transient fault by eventually satisfying and maintaining a legitimacy predicate, and it is (2) guaranteed to satisfy a passage predicate at all times when the system undergoes topology changes starting from a legitimate state. The passage predicate is typically a safety property that should hold while the protocol makes progress toward reestablishing legitimacy following a topology change. Specific contributions of the paper include: the definition of the class of superstabilizing protocols; metrics for evaluating superstabilizing protocols; superstabilizing protocols for coloring and spanning tree construction; a general method for converting self-stabilizing protocols into superstabilizing ones; and a generalized form of a self-stabilizing topology update protocol which may have useful applications for other research.