APPLYING STATIC NETWORK PROTOCOLS TO DYNAMIC NETWORKS.

Yehuda Afek*, Baruch Awerbuch, Eli Gafni

*Corresponding author for this work

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

Abstract

The authors address the problem of how to adapt an algorithm designed for fixed-topology networks to produce the intended results when it is run in a network with topology that changes dynamically during its execution. They present a simple and unified procedure, called a reset procedure, which, when combined with the static algorithm, achieves this adaptation. The communication and time complexities of the reset procedure, per topological change, are independent of the number of topological changes and are linearly bounded by the size of the subset of the network that participates in the algorithm.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages358-370
Number of pages13
ISBN (Print)0818608072, 9780818608070
DOIs
StatePublished - 1987
Externally publishedYes

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

Fingerprint

Dive into the research topics of 'APPLYING STATIC NETWORK PROTOCOLS TO DYNAMIC NETWORKS.'. Together they form a unique fingerprint.

Cite this