Making asynchronous distributed computations robust to noise

Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating an optimal corruption of a Θ(1 / n) fraction of all messages and incurring a moderate blowup of O(nlog 2n) in the communication complexity. Our result is the first fully distributed interactive coding scheme in which the topology of the communication network is not known in advance. Prior work required either a coordinating node to be connected to all other nodes in the network or assumed a synchronous network in which all nodes already know the complete topology of the network.

Original languageEnglish
Pages (from-to)405-421
Number of pages17
JournalDistributed Computing
Volume32
Issue number5
DOIs
StatePublished - 1 Oct 2019

Bibliographical note

Publisher Copyright:
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature.

Keywords

  • Adversarial noise
  • Computation with noise
  • Interactive coding

Fingerprint

Dive into the research topics of 'Making asynchronous distributed computations robust to noise'. Together they form a unique fingerprint.

Cite this