Abstract
We present a self-stabilizing randomized protocol for the Unique Naming problem. In the Unique Naming problem an anonymous system assigns unique names to all the processors in the system. Let G be the underlying interconnection network. If N is a known bound on the network size then our protocol uses O(CGNlogN) bits and stabilizes within O(CG) rounds where CG is the cover time of G. The protocol is uniform, tolerates dynamic changes of the network topology, and works correctly under a very powerful adversary which at any stage has knowledge of a bounded number of future random choices of the processors and it can even bias all future random choices.
We then show that a small modification to our protocol provides a solution for another important problem; the Topology problem in which each node in an anonymous network computes an exact description of the network's topology. Moreover these two protocols yield uniform and bounded space solutions to many other important problems such as Leader Election, Spanning Tree, Mutual Exclusion (Token Management), etc.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
E. Anagnostou, R. El-Yaniv, and V. Hadzilacos. Fast and Simple Self-Stabilizing Algorithms, 1991. In preparation.
E. Anagnostou, R. El-Yaniv, and H. Tamaki. A Self Stabilizing Reduction and Applications, 1991. Unpublished Manuscript.
E. Arjomandi, M. Fisher, and N. Lynch. Efficiency of Synchronous Versus Asynchronous Distributed Systems. Journal of the ACM, 30 (3):449–456, 1983.
R. Aleliunas, R. Karp, R. Lipton, L. Lovász, and C. Rackoff. Random walks, Universal traversal sequences, and the complexity of maze problems. In Proc. of the 20th Annual Symposium on Foundations of Computer Science, pages 218–223, 1979.
Y. Afek, S. Kutten, and M. Yung. Memory-Efficient Self Stabilizing Protocols for General Networks. In 4th IWDAG, pages 15–28, Bari, Italy, September, 1990.
Y. Afek, S. Kutten, and M. Yung, August, 1991. Personal Communication.
B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-Stabilization by Local Checking and Correction. In 32nd FOCS, October, 1991.
B. Awerbuch and G. Varghese. Distributed Program Checking: a Paradigm for Building Self-Stabilizing Distributed Protocols. In 32nd FOCS, October, 1991.
G. Brown, M. Gouda, and C. Wu. Token Systems that Self-Stabilize. IEEE Transactions on Computers, 38, 6:845–852, 1989.
A. Broder and A. Karlin. Bounds on Cover Times. Journal of Theoretical Probability, 2:101–120, 1989.
A. Broder, A. Karlin, P. Raghavan, and E. Upfal. Trading Space for Time in Undirected s-t Connectivity. In Proc. of the 21st ACM Symposium on Theory of Computing, pages 543–549, Seattle, WA, 1989.
L. E. Burns and J. Pachl. Uniform Self-Stabilizing Rings. ACM Transactions on Programming Languages and Systems, 11, 2:330–344, 1989.
A. Chandra, P. Raghavan, W. Ruzzo, R. Smolensky, and P. Tiwari. The Electrical Resistance of a Graph Captures its Commute and Cover Times. In Proc. of the 21st ACM Symposium on Theory of Computing, pages 574–586, Seattle, WA, 1989.
E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Comm. of the ACM, 17(11):643–644, 1974.
S. Dolev, A Israeli, and S. Moran. Self Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. In Proc. of the 9th ACM Symposium on Principles of Distributed Computing, pages 103–117, Quebec City, Canada, 1990.
S. Dolev, A. Israeli, and S. Moran. Uniform Dynamic Self-Stabilizing Leader Election. In 5th IWDAG, Delphi, Greece, October, 1991.
A. Israeli and M. Jalfon. Token Management Schemes and Random Walks Yield Self Stabilizing Mutual Exclusion. In Proc. of the 9th ACM Symposium on Principles of Distributed Computing, pages 119–131, 1990.
Marc Jalfon. Randomized Self Stabilizing Uniform Protocols for Distributed Systems. Master's thesis, Department of Computer Science, Technion, 1990.
S. Katz and K. J. Perry. Self-stabiling Extensions for Message-passing Systems. In Proc. of the 9th ACM Symp. on Principles of Distr. Computing, pages 91–101, Quebec City, Canada, 1990.
H. S. Kruijer. Self-stabilization (in spite of distributed control) in tree-structured systems. Inf. Proc. Letters, 8, 2:91–95, 1979.
B. Schieber and M. Snir. Calling Names on Nameless Networks. In Proc. of the 8th ACM Symp. on Prcnciples of Distr. Computing, pages 319–328, Edmonton, Canada, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anagnostou, E., El-Yaniv, R. (1992). More on the power of random walks: Uniform self-stabilizing randomized algorithms. In: Toueg, S., Spirakis, P.G., Kirousis, L. (eds) Distributed Algorithms. WDAG 1991. Lecture Notes in Computer Science, vol 579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022436
Download citation
DOI: https://doi.org/10.1007/BFb0022436
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55236-9
Online ISBN: 978-3-540-46789-2
eBook Packages: Springer Book Archive