Abstract
We describe a method for transforming asynchronous network protocols into protocols that can sustain any transient fault, i.e., become self-stabilizing. We combine the known notion of local checking with a new notion of internal reset, and prove that given any self-stabilizing internal reset protocol, any locally-checkable protocol can be made self-stabilizing. Our proof is constructive in the sense that we provide explicit code. The method applies to many practical network problems, including spanning tree construction, topology update, and virtual circuit setup.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Yehuda Afek, Baruch Awerbuch, and Eli Gafni. Applying static network protocols to dynamic networks. In Proc. 28th IEEE Symp. on Foundations of Computer Science, October 1987.
Anish Arora and Mohamed G. Gouda. Distributed reset. In Proc. 10th Conf. on Foundations of Software Technology and Theoretical Computer Science, pages 316–331. Spinger-Verlag (LNCS 472), 1990.
Baruch Awerbuch and Shimon Even. Reliable broadcast protocols in unreliable networks. Networks, 16(4):381–396, Winter 1986.
Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, and George Varghese. Time optimal self-stabilizing synchronization. In Proc. 25th ACM Symp. on Theory of Computing, May 1993.
Yehuda Afek, Shay Kutten, and Moti Yung. Memory-efficient self-stabilization on general networks. In Proc. 4th Workshop on Distributed Algorithms, pages 15–28, Italy, September 1990. Springer-Verlag (LNCS 486).
Baruch Awerbuch, Boaz Patt-Shamir, and George Varghese. Self-stabilization by local checking and correction. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, October 1991.
Baruch Awerbuch and George Varghese. Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, October 1991.
Baruch Awerbuch and Rafail Ostrovsky. Memory-efficient and self-stabilizing network RESET. In Proc. 13th ACM Symp. on Principles of Distributed Computing, August 1994.
J.E. Burns and J. Pachl. Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems, 11(2):330–344, 1989.
K. Mani Chandy and Leslie Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Trans. on Comput. Syst., 3(1):63–75, February 1985.
Edsger W. Dijkstra. Self stabilization in spite of distributed control. Comm. of the ACM, 17:643–644, 1974.
Shlomi Dolev, Amos Israeli, and Shlomo Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. In Proc. 10th ACM Symp. on Principles of Distributed Computing, August 1990.
Shlomi Dolev, Amos Israeli, and Shlomo Moran. Resource bounds for self-stabilizing message driven protocols. In Proc. 11th ACM Symp. on Principles of Distributed Computing, Aug. 1991.
Steven G. Finn. Resynch procedures and a fail-safe network protocol. IEEE Trans. on Commun., COM-27(6):840–845, June 1979.
L. Kleinrock and F. Kamoun. Hierarchical routing for large networks; performance evaluation and optimization. Computer Networks, 1:155–174, 1977.
Shmuel Katz and Kenneth Perry. Self-stabilizing extensions for message-passing systems. In Proc. 10th ACM Symp. on Principles of Distributed Computing, August 1990.
Nancy A. Lynch and Mark R. Tuttle. An introduction to input/output automata. CWI Quarterly, 2(3):219–246, 1989.
M. Merritt, F. Modugno, and M.R. Tuttle. Time constrained automata. In CONCUR 91, pages 408–423, 1991.
John McQuillan, Ira Richer, and Eric Rosen. The new routing algorithm for the arpanet. IEEE Trans. on Commun., 28(5):711–719, May 1980.
Radia Perlman. Fault tolerant broadcast of routing information. Computer Networks, Dec. 1983.
Radia Perlman. An algorithm for distributed computation of a spanning tree in an extended LAN. In Proceedings of the the 9th Data Communication Symposium, pages 44–53, September 1985.
Radia Perlman, George Varghese, and Anthony Lauck. Reliable broadcast of information in a wide area network. US Patent 5,085,428, February 1992.
Thomas Rodeheffer and Michael Schroeder. Automatic reconfiguration in the Autonet. Proceedings of the 14th Symposium on Operating Systems Principles, November 1993.
Thomas Rodeheffer and Michael Schroeder. Personal communication.
M. Schroeder, A. Birrell, M. Burrows, H. Murray, R. Needham, T. Rodeheffer, E. Sattenthwaite, and C.Thacker. Autonet: a high-speed, self-configuring local area network using point-to-point links. Technical Report 59, Digital System Research Center, April 1990.
John M. Spinelli. Reliable communication. Ph.d. thesis, MIT, Lab. for Information and Decision Systems, December 1988.
A. Tanenbaum. Computer Networks. Prentice Hall, 2nd. edition, 1989.
George Varghese. Self-stabilization by local checking and correction. Ph.D. Thesis MIT/LCS/TR-583, Massachusetts Institute of Technology, 1992.
George Varghese. Self-stabilization by counter flushing. In Proc. 13th ACM Symp. on Principles of Distributed Computing, August 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Awerbuch, B., Patt-Shamir, B., Varghese, G., Dolev, S. (1994). Self-stabilization by local checking and global reset. In: Tel, G., Vitányi, P. (eds) Distributed Algorithms. WDAG 1994. Lecture Notes in Computer Science, vol 857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020443
Download citation
DOI: https://doi.org/10.1007/BFb0020443
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58449-0
Online ISBN: 978-3-540-48799-9
eBook Packages: Springer Book Archive