Abstract
Topology update is a major component in routing protocols operating in existing communication networks. This paper presents a new efficient topology update protocol that works in dynamic networks that may never stabilize. Our protocol does not use unbounded counters and has O(m) amortized message complexity per topological change, where m is the number of edges. The protocol is very simple and is based on a “hop counter” technique. Our protocol uses a novel technique that combines a dynamic protocol (that works under the assumption that the network never stabilizes) and an eventually stable protocol (that works under the assumption that the network stabilizes).
Supported by Air Force contract TNDGAFOSR-86-0078, ARO contract DAAL03-86-K-0171 and NSF contract CCR8611442.
Part of the work was done while the author was at LCS,MIT, Cambridge, MA 02139.
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 28th Annual Symposium on Foundations of Computer Science. IEEE, October 1987.
B. Awerbuch, I. Cidon, and S. Kutten. Optimal maintenance of replicated information. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), St. Louis, Missouri, pages 492–502, 1990.
Baruch Awerbuch and Shimon Even. A formal approach to a communication-network protocol; broadcast as a case study. Technical Report TR-459, Electrical Engineering Department, Technion-I.I.T., Haifa, December 1983.
Yehuda Afek and Eli Gafni. End-to-end communication in unreliable networks. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, Toronto, Ontario, Canada, pages 131–148. ACM SIGACT and SIGOPS, ACM, 1988.
Yehuda Afek and Eli Gafni. Bootstrap network resynchronization. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 295–308, August 1991.
Yehuda Afek, Eli Gafni, and Adi Rosen. The slide mechanism with applications in dynamic networks. to appear in PODC 1992.
B. Awerbuch, Y. Mansour, and N. Shavit. Polynomial end-to-end communication. In 30th Annual Symposium on Foundations of Computer Science, pages 358–363, 1989.
Baruch Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 230–240. ACM, May 1987.
Amir Herzberg and Shay Kutten. Efficient detection of message forwarding faults. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, pages 339–353, 1989.
John M. Spinelli and Robert G. Gallager. Broadcasting topology information in computer networks. IEEE Trans. Comm., May 1989. to appear.
A. Tannenbaum. Computer Networks. Prentice Hall, 1981.
U. Vishkin. A distributed orientation algorithm. IEEE Trans. Info. Theory, June 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Awerbuch, B., Mansour, Y. (1992). An efficient topology update protocol for dynamic networks. 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_13
Download citation
DOI: https://doi.org/10.1007/3-540-56188-9_13
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