Resource Bounds for Self-Stabilizing Message-Driven Protocols

Authors:
Shlomi Dolev;Amos Israeli;Shlomo Moran
Affiliations:
-;-;-
Venue:
SIAM Journal on Computing
Year:
1997

Citing 0
Cited 11

Finite-state self-stabilizing protocols in message-passing systems

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Transformations of Self-Stabilizing Algorithms

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Self-stabilization with path algebra

Theoretical Computer Science
Universal dynamic synchronous self-stabilization

Distributed Computing
Transformations of self-stabilizing algorithms

Journal of High Speed Networks - Self-Stabilizing Systems, Part 1
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing
When consensus meets self-stabilization

Journal of Computer and System Sciences
Self-stabilizing algorithms

Algorithms and theory of computation handbook
Stabilizing data-link over non-FIFO channels with optimal fault-resilience

Information Processing Letters
Pragmatic self-stabilization of atomic memory in message-passing systems

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-FIFO) dynamic networks

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Self-stabilizing message-driven protocols are defined and discussed. The class weak exclusion that contains many natural tasks such as $\ell$-exclusion and token passing is defined, and it is shown that in any execution of any self-stabilizing protocol for a task in this class, the configuration size must grow at least in a logarithmic rate. This last lower bound is valid even if the system is supported by a time-out mechanism that prevents communication deadlocks. Then we present three self-stabilizing message-driven protocols for token passing. The rate of growth of configuration size for all three protocols matches the aforementioned lower bound. Our protocols are presented for two-processor systems but can be easily adapted to rings of arbitrary size. Our results have an interesting interpretation in terms of automata theory.