Adapting to asynchronous dynamic networks

Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael Saks

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

Abstract

The computational power of different communication models is a fundamental question in the theory of distributed computation. For example, in the synchronous model messages are assumed to be delivered within one time unit, whereas in the asynchronous model message delays may be arbitrary. Another important parameter of the model is the assumptions about the topology. In the dynamic topology model, links are assumed to crash and recover dynamically, but their status is known to the incident node processors. A meaningful computation can be carried out if the topology stabilizes for a sufficiently long period. In this paper we show that the model of asynchronous, dynamic-topology network is equivalent, up to polylogarith-mic factors, to the synchronous, static (i.e., fixed-topology) model. Specifically, we present a simulation methodology of synchronous static protocols that can withstand arbitrary link delays and changing topology at the expense of only polylogarithmic blowup in the running time, the number of messages, and the space requirement. Previous methods entailed a linear blowup in at least one of these resources. The generality of our method is demonstrated by a series of improvements for important applications, including Breadth First Search, computing compact efficient routing tables, and packet routing on asynchronous networks.

Original languageEnglish
Title of host publicationProceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992
PublisherAssociation for Computing Machinery
Pages557-570
Number of pages14
ISBN (Electronic)0897915119
DOIs
StatePublished - 1 Jul 1992
Externally publishedYes
Event24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada
Duration: 4 May 19926 May 1992

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129722
ISSN (Print)0737-8017

Conference

Conference24th Annual ACM Symposium on Theory of Computing, STOC 1992
Country/TerritoryCanada
CityVictoria
Period4/05/926/05/92

Fingerprint

Dive into the research topics of 'Adapting to asynchronous dynamic networks'. Together they form a unique fingerprint.

Cite this