Self-stabilizing systems in spite of distributed control
Communications of the ACM
A latency optimal superstabilizing mutual exclusion protocol in unidirectional rings
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing mutual exclusion
Distributed Computing
A Self-Stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Mobile Networks
IEEE Transactions on Parallel and Distributed Systems
Superstabilizing, fault-containing distributed combinatorial optimization
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Fault-Containing Self-Stabilization in Asynchronous Systems with Constant Fault-Gap
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing 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
A new technique for proving self-stabilizing under the distributed scheduler
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing local k-placement of replicas with minimal variance
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
Bounding the impact of transient small-scale faults by self-stabilizing protocols has been pursued with independent objectives: Optimizing the system's reaction upon topological changes (e.g. super-stabilization), and reducing system recovery time from memory corruptions (e.g. fault-containment). Even though transformations adding either super-stabilization or fault-containment to existing protocols exist, none of them preserves the other. This paper makes a first attempt to combine both objectives. We provide a transformation adding faultcontainment to silent self-stabilizing protocols while simultaneously preserving the property of self-stabilization and the protocol's behavior in face of topological changes. In particular, the protocol's response to a topology change remains unchanged even if a memory corruption occurs in parallel to the topology change. The presented transformation increases the memory footprint only by a factor of 4 and adds O(1) bits per edge. All previously known transformations for faultcontaining self-stabilization increase the memory footprint by a factor of 2m/n.