Abstract
A self-stabilizing system is a distributed system which can be started in any possible global state. Once started the system regains its consistency by itself, without any kind of an outside intervention. A ring is a distributed system in which all processors are connected in a ring. A ring is oriented if all processors in the ring agree on common right and left directions. A protocol is uniform if all processors use the same program.
In this paper we answer the following question: Does a uniform self stabilizing protocol for ring orientation exist? We begin the presentation by answering this question negatively for deterministic protocols. Then we present a randomized uniform self stabilizing protocol for ring orientation. When the protocol stabilizes all processors agree upon a “right” (privileged) direction. The protocol works for a ring of any size and even tolerates dynamic additions and removals of processors as long as the ring topology is preserved. The number of states of each processor is O(1), and its stabilization time is O(n 2), where n is the number of processors in the system.
Partially supported by Technion VPR Funds - Japan TS Research Fund and B. & G. Greenberg Research Fund (Ottawa).
Partially supported by a Gutwirth fellowship.
Preview
Unable to display preview. Download preview PDF.
References
Y. Afek and G. M. Brown, “Self Stabilization of the Alternating-Bit Protocol” Proceedings of the 16th Conference of IEEE in Israel, March 1989.
G.M. Brown, M.G. Gouda, and C.L. Wu, “A Self-Stabilizing Token system”, Proc. of the Twentieth Annual Hawaii International Conference on System sciences (1987), pp. 218–223.
J.E. Burns and J. Pachl, “Uniform Self-Stabilizing Rings”, Aegean Workshop On Computing, 1988, Lecture notes in computer science 319, pp. 391–400.
J.E. Burns, “Self-Stabilizing Rings without Demons”, Technical Report GIT-ICS-87/36, Georgia Institute Of Technology.
E.W. Dijkstra, “Self-Stabilizing Systems in Spite of Distributed Control”, Communications of the ACM 17,11 (1974), pp. 643–644.
S. Dolev, A. Israeli and S. Moran, “Self Stabilization of Dynamic Systems”, to be presented in PODC90.
A. Israeli and M. Jalfon, “Token Management Schemes and Random walks Yield Self Stabilizing Mutual Exclusion”, to be presented in PODC90.
S. Katz and K.J. Perry, “Self-stabilizing Extensions”, to be presented in PODC90.
H.S.M. Kruijer, “Self-stabilization (in spite of distributed control) in tree-structured systems”, Information Processing Letters 8,2 (1979), pp. 91–95.
M. Tchuente, “Sur l'auto-stabilisation dans un réseau d'ordinateurs”, RAIRO Inf. Théor. 15 (1981), pp. 47–66.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Israeli, A., Jalfon, M. (1991). Self-stabilizing ring orientation. In: van Leeuwen, J., Santoro, N. (eds) Distributed Algorithms. WDAG 1990. Lecture Notes in Computer Science, vol 486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54099-7_1
Download citation
DOI: https://doi.org/10.1007/3-540-54099-7_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54099-1
Online ISBN: 978-3-540-47405-0
eBook Packages: Springer Book Archive