@inproceedings{95e3e849e8f74ef4a220b240614157fc,
title = "An efficient topology update protocol for dynamic networks",
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).",
author = "Baruch Awerbuch and Yishay Mansour",
note = "Publisher Copyright: {\textcopyright} 1992, Springer Verlag. All rights reserved.; 6th International Workshop on Distributed Algorithms, WDAG 1992 ; Conference date: 02-11-1992 Through 04-11-1992",
year = "1992",
doi = "10.1007/3-540-56188-9_13",
language = "אנגלית",
isbn = "9783540561880",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "185--202",
editor = "Adrian Segall and Shmuel Zaks",
booktitle = "Distributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings",
address = "גרמניה",
}