Bootstrap network resynchronization

Yehuda Afek, Eli Gafni

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

Abstract

The problem of applying static distributed algorithms in an eventually connected network is addressed. We propose a new technique, bootstrap resynchronization, by which any static diffusing computations can be reliably adapted to such a network. The communication overhead for each execution of the diffusing computation adapted by our technique is 0(nE) messages, were n and E are the total number of nodes and links in the network. The time overhead of the bootstrap resynchronization per execution is 0(n2). One of the simplest diffusing computations is flood. Flood can be used to send a data item in the end-to-end problem, and to receive its acknowledgment in a return flood. Applying our technique to this algorithm results in an 0(nE) messages per data item, data oblivious end-to-end protocol (0(E • D + nE log n) bits of communication per data item of size D bits).

Original languageEnglish
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages295-307
Number of pages13
ISBN (Print)0897914392
DOIs
StatePublished - 1 Jul 1991
Event10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991 - Montreal, Canada
Duration: 19 Aug 199121 Aug 1991

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991
Country/TerritoryCanada
CityMontreal
Period19/08/9121/08/91

Fingerprint

Dive into the research topics of 'Bootstrap network resynchronization'. Together they form a unique fingerprint.

Cite this