We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Probabilistic consensus via polling and majority rules.
- Authors
Cruise, James; Ganesh, Ayalvadi
- Abstract
In this paper, we consider lightweight decentralised algorithms for achieving consensus in distributed systems. Each member of a distributed group has a private value from a fixed set consisting of, say, two elements, and the goal is for all members to reach consensus on the majority value. We explore variants of the voter model applied to this problem. In the voter model, each node polls a randomly chosen group member and adopts its value. The process is repeated until consensus is reached. We generalise this so that each member polls a (deterministic or random) number of other group members and changes opinion only if a suitably defined super-majority has a different opinion. We show that this modification greatly speeds up the convergence of the algorithm, as well as substantially reducing the probability of it reaching consensus on the incorrect value.
- Subjects
EXIT polling (Elections); PROBABILITY theory; MARKOV processes; POISSON processes; CONSENSUS (Social sciences)
- Publication
Queueing Systems, 2014, Vol 78, Issue 2, p99
- ISSN
0257-0130
- Publication type
Article
- DOI
10.1007/s11134-014-9397-7