Communication cost of consensus for nodes with limited memory

01/07/2019
by   Giulia Fanti, et al.
0

Motivated by applications in blockchains and sensor networks, we consider a model of n nodes trying to reach consensus on their majority bit. Each node i is assigned a bit at time zero, and is a finite automaton with m bits of memory (i.e., 2^m states) and a Poisson clock. When the clock of i rings, i can choose to communicate, and is then matched to a uniformly chosen node j. The nodes j and i may update their states based on the state of the other node. Previous work has focused on minimizing the time to consensus and the probability of error, while our goal is minimizing the number of communications. We show that when m>3 (n), consensus can be reached at linear communication cost, but this is impossible if m<(n). We also study a synchronous variant of the model, where our upper and lower bounds on m for achieving linear communication cost are 2(n) and (n), respectively. A key step is to distinguish when nodes can become aware of knowing the majority bit and stop communicating. We show that this is impossible if their memory is too low.

READ FULL TEXT
research
06/02/2023

Broadcasting in random recursive dags

A uniform k-dag generalizes the uniform random recursive tree by picking...
research
12/31/2020

Consensus with Bounded Space and Minimal Communication

Population protocols are a fundamental model in distributed computing, w...
research
07/30/2020

Phase Transitions of the k-Majority Dynamics in a Biased Communication Model

Consider a graph where each of the n nodes is in one of two possible sta...
research
05/19/2023

Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication

We develop deterministic algorithms for the problems of consensus, gossi...
research
03/20/2018

Broadcasting on Bounded Degree DAGs

We study the following generalization of the well-known model of broadca...
research
06/07/2018

Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies

We study the problem of distributed plurality consensus among n nodes, e...
research
05/11/2018

Majority & Stabilization in Population Protocols

Population protocols are a distributed model focused on simplicity and r...

Please sign up or login with your details

Forgot password? Click here to reset