License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2020.42
URN: urn:nbn:de:0030-drops-117277
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/11727/
Clementi, Andrea ;
Gualà, Luciano ;
Natale, Emanuele ;
Pasquale, Francesco ;
Scornavacca, Giacomo ;
Trevisan, Luca
Consensus vs Broadcast, with and Without Noise (Extended Abstract)
Abstract
Consensus and Broadcast are two fundamental problems in distributed computing, whose solutions have several applications. Intuitively, Consensus should be no harder than Broadcast, and this can be rigorously established in several models. Can Consensus be easier than Broadcast?
In models that allow noiseless communication, we prove a reduction of (a suitable variant of) Broadcast to binary Consensus, that preserves the communication model and all complexity parameters such as randomness, number of rounds, communication per round, etc., while there is a loss in the success probability of the protocol. Using this reduction, we get, among other applications, the first logarithmic lower bound on the number of rounds needed to achieve Consensus in the uniform GOSSIP model on the complete graph. The lower bound is tight and, in this model, Consensus and Broadcast are equivalent.
We then turn to distributed models with noisy communication channels that have been studied in the context of some bio-inspired systems. In such models, only one noisy bit is exchanged when a communication channel is established between two nodes, and so one cannot easily simulate a noiseless protocol by using error-correcting codes. An Ω(ε^{-2} n) lower bound is proved by Boczkowski et al. [PLOS Comp. Bio. 2018] on the convergence time of binary Broadcast in one such model (noisy uniform PULL), where ε is a parameter that measures the amount of noise).
We prove an O(ε^{-2} log n) upper bound on the convergence time of binary Consensus in such model, thus establishing an exponential complexity gap between Consensus versus Broadcast. We also prove our upper bound above is tight and this implies, for binary Consensus, a further strong complexity gap between noisy uniform PULL and noisy uniform PUSH. Finally, we show a Θ(ε^{-2} n log n) bound for Broadcast in the noisy uniform PULL.
BibTeX - Entry
@InProceedings{clementi_et_al:LIPIcs:2020:11727,
author = {Andrea Clementi and Luciano Gual{\`a} and Emanuele Natale and Francesco Pasquale and Giacomo Scornavacca and Luca Trevisan},
title = {{Consensus vs Broadcast, with and Without Noise (Extended Abstract)}},
booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)},
pages = {42:1--42:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-134-4},
ISSN = {1868-8969},
year = {2020},
volume = {151},
editor = {Thomas Vidick},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11727},
URN = {urn:nbn:de:0030-drops-117277},
doi = {10.4230/LIPIcs.ITCS.2020.42},
annote = {Keywords: Distributed Computing, Consensus, Broadcast, Gossip Models, Noisy Communication Channels}
}
|
Keywords: |
|
Distributed Computing, Consensus, Broadcast, Gossip Models, Noisy Communication Channels |
|
Collection: |
|
11th Innovations in Theoretical Computer Science Conference (ITCS 2020) |
|
Issue Date: |
|
2020 |
|
Date of publication: |
|
06.01.2020 |
