在有限的ID空间中达到分布式平衡
Reaching Distributed Equilibrium with Limited ID Space
摘要:
我们研究的ID空间的大小和合理的代理商在网络中的数量之间的关系,在分布式算法的平衡是可能的。当网络中的代理数量不是先验已知的时,单个代理可以复制以获得优势,假装是多个代理。然而,当id空间有限时,每次重复都有被捕获的风险。通过比较的优势,给定的ID空间的大小$L$的风险,我们提供了一种方法来计算最小阈值$t$,所需的代理网络中,这样的算法是在平衡。也就是说,它是$t$的最小值,使得如果代理先验知道$n \geq t$,则算法处于平衡。我们证明了这种方法,将其应用到两个问题,领导选举和知识共享,以及提供一个恒定的时间近似$t \approx \frac{L}{5}$的最小阈值的领导选举。
英文摘要:
We examine the relation between the size of the id space and the number of rational agents in a network under which equilibrium in distributed algorithms is possible. When the number of agents in the network is not a-priori known, a single agent may duplicate to gain an advantage, pretending to be more than one agent. However, when the id space is limited, each duplication involves a risk of being caught. By comparing the risk against the advantage, given an id space of size $L$, we provide a method of calculating the minimal threshold $t$, the required number of agents in the network, such that the algorithm is in equilibrium. That is, it is the minimal value of $t$ such that if agents a-priori know that $n \geq t$ then the algorithm is in equilibrium. We demonstrate this method by applying it to two problems, Leader Election and Knowledge Sharing, as well as providing a constant-time approximation $t \approx \frac{L}{5}$ of the minimal threshold for Leader Election.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。