An efficient topology update protocol for dynamic networks

Baruch Awerbuch, Yishay Mansour

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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).

Original languageEnglish
Title of host publicationDistributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings
EditorsAdrian Segall, Shmuel Zaks
PublisherSpringer Verlag
Pages185-202
Number of pages18
ISBN (Print)9783540561880
DOIs
StatePublished - 1992
Externally publishedYes
Event6th International Workshop on Distributed Algorithms, WDAG 1992 - Haifa, Israel
Duration: 2 Nov 19924 Nov 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume647 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Workshop on Distributed Algorithms, WDAG 1992
Country/TerritoryIsrael
CityHaifa
Period2/11/924/11/92

Fingerprint

Dive into the research topics of 'An efficient topology update protocol for dynamic networks'. Together they form a unique fingerprint.

Cite this