Making asynchronous distributed computations robust to channel noise

Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler

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

8 Scopus citations


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 a maximal corruption level of (1/n)-fraction of all messages. Our noise tolerance is optimal and is obtained with only a moderate overhead in the number of messages. 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. Overcoming this more realistic setting of an unknown topology leads to intriguing distributed problems, in which nodes try to learn su cient information about the network topology in order to perform efficient coding and routing operations for coping with the noise. What makes these problems hard is that these topology exploration computations themselves must already be robust to noise.

Original languageEnglish
Title of host publication9th Innovations in Theoretical Computer Science, ITCS 2018
EditorsAnna R. Karlin
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770606
StatePublished - 1 Jan 2018
Event9th Innovations in Theoretical Computer Science, ITCS 2018 - Cambridge, United States
Duration: 11 Jan 201814 Jan 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference9th Innovations in Theoretical Computer Science, ITCS 2018
Country/TerritoryUnited States

Bibliographical note

Funding Information:
Research supported in part by the Israel Science Foundation (grants 1696/14 and 1078/17), the Binational Science Foundation (grant 2015803), and NSF grants CCF-1527110 and CCF-1618280.

Publisher Copyright:
© Keren Censor-Hillel, Ran Gelles, and Bernhard Haeupler.


  • Coding Theory
  • Coding for Interactive Communication
  • Distributed Computation
  • Noise-Resilient Computation


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

Cite this