Abstract
In this work, we analyze the performance of a simple majority-rule protocol solving a fundamental coordination problem in distributed systems—binary majority consensus—in the presence of probabilistic message loss. Using probabilistic analysis for a large-scale, fully-connected, network of 2n agents, we prove that the Simple Majority Protocol (SMP) reaches consensus in only three communication rounds, with probability approaching 1 as n grows to infinity. Moreover, if the difference between the numbers of agents that hold different opinions grows at a rate of n, then the SMP with only two communication rounds attains consensus on the majority opinion of the network, and if this difference grows faster than n, then the SMP reaches consensus on the majority opinion of the network in a single round, with probability converging to 1 as exponentially fast as n→∞. We also provide some converse results, showing that these requirements are not only sufficient, but also necessary.
Subject
General Physics and Astronomy
Reference50 articles.
1. On construction of a distributed data storage system in cloud
2. The free haven project: Distributed anonymous storage service;Dingledine,2001
3. Timestamps in message-passing systems that preserve the partial ordering;Fidge;Proc. Aust. Comput. Sci. Conf.,1987
4. Virtual Time and Global States of Distributed Systems;Mattern,1989
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Reaching Consensus in Dense Erdős–Rényi Graphs;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25