Self-stabilizing extensions for message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Stabilization and pseudo-stabilization
Distributed Computing - Special issue: Self-stabilization
| Hi-index | 0.00 |
A self-stablizing system is one which if started at any unsafe state, is guaranteed to converge to a safe state within a finite number of state transitions. The convergence span of such a system is defined as the maximum number of critical transitions that can be executed before the system reaches a safe state. In this paper, we discuss the tradeoff between the convergence span of a self-stabilizing system and its response span. In particular, we argue that the convergence span can be reduced by some factor by increasing the response span by the same factor, and vice versa. Our discussion is centered on a class of self-stabilizing systems for detecting termination on a uni-directional ring. The discussion leads to a family of systems whose convergence span is O(n/k), and whose response span is O(nk), where n is the number of processes in the system, and k is a parameter whose value can be chosen arbitrarily from the domain 1...n.