Abstract
A simple, general and optimal procedure to adapt algorithms designed for fixed topology networks to run on a network with dynamically changing topology is presented. The communication and time complexities of the procedure, per topological change, are independent of the number of topological changes and are linearly bounded by the size of the subnetwork over which the algorithm is running.
(Extended Abstract)
This paper is an abstract of the paper "Applying Static Network Protocols to Dynamic Networks" Proc. 28th IEEE Symp. on Foundations of Computer Science, October 1987.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, “Complexity of Network Synchronization,” Journal of the ACM 32(4), pp.804–823 (October 1985).
B. Awerbuch and R. Gallager, “Distributed BFS algorithms,” Proceedings of IEEE conference on Foundations of Computer Science (October 1985).
A. E. Baratz and A. Segall, “Reliable Link Initialization Procedures,” IFIP 3rd Workshop on Protocol Specification, Testing and Verification, III (May 1983).
K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson, “A note on reliable full-duplex transmission over half-duplex links,” Comm of the ACM 12, pp.260–261 (1969).
K. M. Chandy and L. Lamport, “Distributed Snapshots: Determining Global States of Distributed Systems,” ACM TOCS 3(1), pp.63–75 (January 1985).
E. J. Chang, “Decentralized Algorithms in Distributed Systems,” CSRG-103, University of Toronto, Toronto, Canada (October 1979). Ph.D. Thesis.
I. Cidon and A. Segall, “Network Resynch Protocols,” unpubliched manuscript, Technion 1982.
S. G. Finn, “Resynch Procedures and Fail-Safe Network Protocol,” IEEE Tranc. on Comm. COM-27, pp.840–845 (June 1979).
R. G. Gallager, A Shortest Path Routing Algorithm with Automatic Resynch, M.I.T. (March 1976). Unpublished note.
R. G. Gallager, “Distributed Minimum Hop Algorithms,” LIDS-P-1175, M.I.T. Lab for Information and Decision Systems (January, 1982).
R. G. Gallager, P. A. Humblet, and P. M. Spira, “A Distributed Algorithm for Minimum Weight Spanning Trees,” ACM Trans. Program. Lang. Syst. 5, pp.66–77 (Jan 1983).
L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System,” CACM 21(7), pp.558–565 (July 1978).
A. Segall, “Distributed Network Protocols,” IEEE Transactions on Information Theory IT-29(1) (January 1983).
A. Segall, I. S. Gopal, and A. E. Baratz, “Query Algorithms in Computer Networks,” 2nd International Workshop on Distributed Algorithms (July 1987).
F. R. Soloway and P. A. Humblet, On distributed network protocols for changing topologies, May 1986. Report LIDC-P-1564 MIT Laboratory for Inf. and Dec. Sys.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afek, Y., Awerbuch, B., Gafni, E. (1988). Local fail-safe network reset procedure. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019805
Download citation
DOI: https://doi.org/10.1007/BFb0019805
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19366-1
Online ISBN: 978-3-540-39239-2
eBook Packages: Springer Book Archive