arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.04996cs.ITcs.DCmath.IT
收藏

不可靠通信网络中的简单多数一致性

Simple Majority Consensus in Networks with Unreliable Communication

Ran Tamir, Ariel Livshits, Yonatan Shadmi

摘要:

在这项工作中,我们分析了一个简单的多数规则协议的性能,解决了一个基本的协调问题,在分布式系统- \emph{binary majority consensus},在概率消息丢失的存在。利用概率分析的大规模,全连接,网络的$2n$代理,我们证明了简单多数协议(SMP)达成共识,只有三个通信轮的概率接近$1$作为$n$增长到无穷大。此外,如果持有不同意见的代理数量之间的差异以$\sqrt{n}$的速度增长,那么只有两轮通信的SMP就能在网络的多数意见上达成共识,如果这个差异比$\sqrt{n}$增长得更快,那么SMP在单轮中就能在网络的多数意见上达成共识,概率以$n \rightarrow \infty$的指数速度收敛到$1$。我们还提供了一些逆结果,表明这些要求不仅是充分的,而且是必要的。

英文摘要:

In this work, we analyze the performance of a simple majority-rule protocol solving a fundamental coordination problem in distributed systems - \emph{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 $\sqrt{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 $\sqrt{n}$, then the SMP reaches consensus on the majority opinion of the network in a single round, with probability converging to $1$ exponentially fast as $n \rightarrow \infty$. We also provide some converse results, showing that these requirements are not only sufficient, but also necessary.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑