Self-stabilization
Self-stabilization with r-operators
Distributed Computing
Distributed Algorithms
Tolerating transient and intermittent failures
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Stabilization of Routing in Directed Networks
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-stabilization with path algebra
Theoretical Computer Science
Self-Stabilizing Unidirectional Network Algorithms by Power Supply
Self-Stabilizing Unidirectional Network Algorithms by Power Supply
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
Light enabling snap-stabilization of fundamental protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
HYMAD: Hybrid DTN-MANET routing for dense and highly dynamic wireless networks
Computer Communications
Conflict-free replicated data types
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
We present a generic distributed algorithm for solving silents tasks such as shortest path calculus, depth-first-search tree construction, best reliable transmitters, in directed networks where communication may be only unidirectional. Our solution is written for the asynchronous message passing communication model, and tolerates multiple kinds of failures (transient and intermittent). First, our algorithm is self-stabilizing, so that it recovers correct behavior after finite time starting from an arbitrary global state caused by a transient fault. Second, it tolerates fair message loss, finite message duplication, and arbitrary message reordering, during both the stabilizing phase and the stabilized phase. This second property is most interesting since, in the context of unidirectional networks, there exists no self-stabilizing reliable data-link protocol. The correctness proof subsumes previous proofs for solutions in the simpler reliable shared memory communication model.