Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise

07/15/2018
by   Andrea Clementi, et al.
0

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 on the number of rounds needed for Broadcast is proved by Boczkowski et al. [PLOS Comp. Bio. 2018] in one such model (noisy uniform PULL, where ϵ is a parameter that measures the amount of noise). In such model, we prove a new Θ(ϵ^-2 n n) bound for Broadcast and a Θ(ϵ^-2 n) bound for binary Consensus, thus establishing an exponential gap between the number of rounds necessary for Consensus versus Broadcast.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2022

Consensus Capacity of Noisy Broadcast Channels

We study communication with consensus over a broadcast channel - the rec...
research
03/07/2019

A Scalable Max-Consensus Protocol For Noisy Ultra-Dense Networks

We introduce ScalableMax, a novel communication scheme for achieving max...
research
12/20/2017

Limits for Rumor Spreading in stochastic populations

Biological systems can share and collectively process information to yie...
research
08/02/2018

Algorithms for Noisy Broadcast under Erasures

The noisy broadcast model was first studied in [Gallager, TranInf'88] wh...
research
12/31/2020

Consensus with Bounded Space and Minimal Communication

Population protocols are a fundamental model in distributed computing, w...
research
04/11/2021

Simple Majority Consensus in Networks with Unreliable Communication

In this work, we analyze the performance of a simple majority-rule proto...
research
05/08/2023

Consensus analysis of random sub-graphs for distributed filtering with link failures

In this paper we carry out a stability analysis of a distributed consens...

Please sign up or login with your details

Forgot password? Click here to reset