Abstract
We present a token-based diffusion scheme that forms the basis of efficient self-stabilizing protocols for a variety of problems including unique naming, network topology, token management. For the model where processors’ initial knowledge about the network is restricted only to their neighbours, we introduce the concept of memory adaptive protocols. In these, once the system stabilizes, the size of the memory used by each processor is a function of the actual network size — even though the system may have been started in a state where each processor “thinks” that it is embedded in a network much larger (or smaller) than the actual one. For this model, we develop memory adaptive self-stabilizing protocols for the problems mentioned above that stabilize in time O(n log log n), where n is the number of processors. For the model where processors also know an upper bound D on the diameter of the network and an upper bound on n, we develop bounded-memory self-stabilizing protocols for the same problems that stabilize in O(min{D,n}) time. All our protocols are based on a token diffusion scheme, and are uniform, in the sense that processors with the same number of neighbours execute the same program.
Research supported by the Natural Sciences and Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y. Afek and G.M. Brown. Self-Stabilization of the Alternating-Bit Protocol. IEEE Proc. on Reliable Distr. Systems, pages 80–83, 1989.
H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk. Achievable cases in an asynchronous environment. In FOCS, pages 337–346, 1987.
E. Anagnostou and R. El-Yaniv. More on the Power of Random Walks: Uniform, Bounded Self-Stabilizing Protocols. In Distributed Algorithms, 5th IWDAG, pages 31–51, Delphi, Greece, October, 1991. Lecture Notes in Computer Science, 579 Springer-Verlag.
E. Arjomandi, M. Fisher, and N. Lynch. Efficiency of Synchronous Versus Asynchronous Distributed Systems. Journal of the ACM, 30 (3):449–456, 1983.
A. Arora and M. Gouda. Distributed Reset (Extended Abstract). In Tenth Conference on FSTCS, pages 316–329, Bangalore, India, 1990.
B. Awerbuch, S. Kutten, and D. Peleg. Efficient Deadlock-Free Routing. In 10th PODC, pages 177–188, 1991.
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.
B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-Stabilization by Local Checking and Correction. In 32nd FOCS, October, 1991.
B. Awerbuch and M. Sipser. Dynamic Networks are as fast as static networks. In 29th FOCS, pages 206–219, 1988.
B. Awerbuch and G. Varghese. Distributed Program Checking: a Paradigm for Building Self-Stabilizing Distributed Protocols. In 32nd FOCS, October, 1991.
B. Awerbuch. On the effects of feedback in dynamic network protocols. In 29th FOCS, pages 231–245, 1988.
A. Bar-Noy and D. Dolev. Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment. In Proc. of the 8th ACM Symposium on Principles of Distributed Computing, pages 307–318, 1989.
G. Brown, M. Gouda, and C. Wu. Token Systems that Self-Stabilize. IEEE Transactions on Computers, 38, 6:845–852, 1989.
L. E. Burns and J. Pachl. Uniform Self-Stabilizing Rings. ACM Transactions on Programming Languages and Systems, 11, 2:330–344, 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.
E. W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. IPL, 11(1):1–4, 1979.
S. G. Finn. Resynch Procedures and a Fail-Safe Network Protocol. IEEE Transactions on Communications, 27(6):840–845, 1979.
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.
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.
L. Lamport. On interprocess communication. Part I: Basic Formalism. Distributed Computing, 1:77–85, 1986.
L. Lamport. On interprocess communication. Part II: Algorithms. Distributed Computing, 1:86–101, 1986.
J. M. Spinelli and R. G., Gallager. Broadcasting topology information in computer networks. IEEE Transactions on Communications, COM-37(5):468–474, 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., Hadzilacos, V. (1992). Memory adaptive self-stabilizing protocols (extended abstract). In: Segall, A., Zaks, S. (eds) Distributed Algorithms. WDAG 1992. Lecture Notes in Computer Science, vol 647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56188-9_14
Download citation
DOI: https://doi.org/10.1007/3-540-56188-9_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56188-0
Online ISBN: 978-3-540-47484-5
eBook Packages: Springer Book Archive