arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.04909cs.DC
收藏

树中具有随机延迟的选举算法

Election algorithms with random delays in trees

Jean-François Marckert, Nasser Saheb-Djahromi, Akka Zemmari

摘要:

选举问题是分布式算法中的经典问题。它的目的是设计和分析一个分布式算法选择一个节点的图,在这里,在一棵树。本文研究了一类随机算法。选举相当于一个接一个地删除叶子,直到树被减少到一个唯一的节点,然后选举。该算法为每个叶分配一个概率分布(其可能取决于被消除的节点发送的信息),该概率分布由叶用来生成其剩余的随机寿命。在一般情况下,每个节点被选中的概率是给定的。对于两类算法,提供了封闭的公式。

英文摘要:

The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is studied. The election amounts to removing leaves one by one until the tree is reduced to a unique node which is then elected. The algorithm assigns to each leaf a probability distribution (that may depends on the information transmitted by the eliminated nodes) used by the leaf to generate its remaining random lifetime. In the general case, the probability of each node to be elected is given. For two categories of algorithms, close formulas are provided.

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

↑