Distributed Computations in Fully-Defective Networks

Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela

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


We address fully-defective asynchronous networks, in which all links are subject to an unlimited number of alteration errors, implying that all messages in the network may be completely corrupted. Despite the possible intuition that such a setting is too harsh for any reliable communication, we show how to simulate any algorithm for a noiseless setting over any fully-defective setting, given that the network is 2-edge connected. We prove that if the network is not 2-edge connected, no non-trivial computation in the fully-defective setting is possible. The key structural property of 2-edge-connected graphs that we leverage is the existence of an oriented (non-simple) cycle that goes through all nodes [Robbins, 1939]. The core of our technical contribution is presenting a construction of such a Robbins cycle in fully-defective networks, and showing how to communicate over it despite total message corruption. These are obtained in a content-oblivious manner, since nodes must ignore the content of received messages.

Original languageEnglish
Title of host publicationPODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
Number of pages10
ISBN (Electronic)9781450392624
StatePublished - 20 Jul 2022
Event41st ACM Symposium on Principles of Distributed Computing, PODC 2022 - Salerno, Italy
Duration: 25 Jul 202229 Jul 2022

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing


Conference41st ACM Symposium on Principles of Distributed Computing, PODC 2022


  • Robbins' theorem
  • fully-defective networks
  • noise resilience

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Distributed Computations in Fully-Defective Networks'. Together they form a unique fingerprint.

Cite this