Distributed Computations in Fully-Defective Networks

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

doi:10.1145/3519270.3538432

Distributed Computations in Fully-Defective Networks

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

Technion-Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

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 language	English
Title of host publication	PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	141-150
Number of pages	10
ISBN (Electronic)	9781450392624
DOIs	https://doi.org/10.1145/3519270.3538432
State	Published - 20 Jul 2022
Event	41st ACM Symposium on Principles of Distributed Computing, PODC 2022 - Salerno, Italy Duration: 25 Jul 2022 → 29 Jul 2022

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	41st ACM Symposium on Principles of Distributed Computing, PODC 2022
Country/Territory	Italy
City	Salerno
Period	25/07/22 → 29/07/22

Bibliographical note

Publisher Copyright:
© 2022 ACM.

Funding

Acknowledgements. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement no. 755839. Ran Gelles is supported in part by the Israel Science Foundation (ISF) through Grant No. 1078/17 and the United States-Israel Binational Science Foundation (BSF) through Grant No. 2020277. Gal Sela is supported in part by the Israel Science Foundation (ISF) through Grant No. 1102/21.

Funders	Funder number
Horizon 2020 Framework Programme	755839
United States-Israel Binational Science Foundation	2020277, 1102/21
Israel Science Foundation	1078/17

Keywords

Robbins' theorem
fully-defective networks
noise resilience

Access to Document

10.1145/3519270.3538432

Cite this

Censor-Hillel, K., Cohen, S., Gelles, R., & Sela, G. (2022). Distributed Computations in Fully-Defective Networks. In PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (pp. 141-150). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). Association for Computing Machinery. https://doi.org/10.1145/3519270.3538432

@inproceedings{11f59b3222344f7a98f4a462d1c7b245,

title = "Distributed Computations in Fully-Defective Networks",

abstract = "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.",

keywords = "Robbins' theorem, fully-defective networks, noise resilience",

author = "Keren Censor-Hillel and Shir Cohen and Ran Gelles and Gal Sela",

note = "Publisher Copyright: {\textcopyright} 2022 ACM.; 41st ACM Symposium on Principles of Distributed Computing, PODC 2022 ; Conference date: 25-07-2022 Through 29-07-2022",

year = "2022",

month = jul,

day = "20",

doi = "10.1145/3519270.3538432",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "141--150",

booktitle = "PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing",

}

Censor-Hillel, K, Cohen, S, Gelles, R & Sela, G 2022, Distributed Computations in Fully-Defective Networks. in PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, pp. 141-150, 41st ACM Symposium on Principles of Distributed Computing, PODC 2022, Salerno, Italy, 25/07/22. https://doi.org/10.1145/3519270.3538432

Distributed Computations in Fully-Defective Networks. / Censor-Hillel, Keren; Cohen, Shir; Gelles, Ran et al.
PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2022. p. 141-150 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Distributed Computations in Fully-Defective Networks

AU - Censor-Hillel, Keren

AU - Cohen, Shir

AU - Gelles, Ran

AU - Sela, Gal

PY - 2022/7/20

Y1 - 2022/7/20

N2 - 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.

AB - 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.

KW - Robbins' theorem

KW - fully-defective networks

KW - noise resilience

UR - http://www.scopus.com/inward/record.url?scp=85135312155&partnerID=8YFLogxK

U2 - 10.1145/3519270.3538432

DO - 10.1145/3519270.3538432

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85135312155

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 141

EP - 150

BT - PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

T2 - 41st ACM Symposium on Principles of Distributed Computing, PODC 2022

Y2 - 25 July 2022 through 29 July 2022

ER -

Distributed Computations in Fully-Defective Networks

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this