Communication cost of consensus for nodes with limited memory

arXiv: Distributed, Parallel, and Cluster Computing, Volume abs/1901.01665, 2019.

Cited by: 0|Bibtex|Views47
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments