Graphs and algorithms
Parallel asynchronous algorithms for discrete data
Journal of the ACM (JACM)
Memory-efficient self stabilizing protocols for general networks
Proceedings of the 4th international workshop on Distributed algorithms
Topics in distributed algorithms
Topics in distributed algorithms
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
ACM Computing Surveys (CSUR)
Uniform self-stabilizing ring orientation
Information and Computation
Introduction to distributed algorithms
Introduction to distributed algorithms
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Self-stabilization by window washing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Crash failures can drive protocols to arbitrary states
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Resource Bounds for Self-Stabilizing Message-Driven Protocols
SIAM Journal on Computing
Asynchronous Iterative Methods for Multiprocessors
Journal of the ACM (JACM)
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Self-stabilization with r-operators
Distributed Computing
Self-Stabilization by Local Checking and Global Reset (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Self-Stabilization with Global Rooted Synchronizers
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Modified tree structure for location management in mobile environments
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Convergence of iteration systems
Distributed Computing - Special issue: Self-stabilization
Route preserving stabilization
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
r-semi-groups: a generic approach for designing stabilizing silent tasks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Best-effort group service in dynamic networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Probabilistic self-stabilizing vertex coloring in unidirectional anonymous networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Self-stabilization with r-operators revisited
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Self-stabilizing distributed data fusion
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 5.23 |
Self-stabilizing protocols can resist transient failures and guarantee system recovery in a finite time. We highlight the connexion between the formalism of self-stabilizing distributed systems and the formalism of generalized path algebra and asynchronous iterations with delay. We use the later to prove that a local condition on locally executed algorithm (being a strictly idempotent r-operator) ensures self-stabilization of the global system. As a result, a parametrized distributed algorithm applicable to any directed graph topology is proposed, and the function parameter of our algorithm is instantiated to produce distributed algorithms for both fundamental and high-level applications. Due to fault resilience properties of our algorithm, the resulting protocols are self-stabilizing at no additional cost.