匿名网络中知识对选举时间的影响
Impact of Knowledge on Election Time in Anonymous Networks
摘要:
首领选举是分布式计算的基本问题之一。对于匿名网络,领导者选举的任务如下:网络的每个节点v必须输出一条简单的路径,该路径被编码为端口号序列,使得所有这些路径都在一个共同的节点,即领导者结束。本文研究了任意匿名网络中的确定性领导选举问题。众所周知,在某些网络中,即使节点知道网络的地图,领导者选举也是不可能的,无论分配的时间量如何。然而,即使在网络中,有可能选出一个知道地图的领导者,没有任何知识,无论分配的时间如何,任务仍然是不可能的。另一方面,对于任何知道地图的领导者选举是可能的网络,有一个最小的时间,称为选举指数,在其中可以完成。非正式地,网络的选举指数是所有节点的视图都不同的最小深度。我们的目标是建立分配的时间$τ$和信息量之间的权衡,必须给予先验的节点,使领导人选举的时间$τ$在所有网络的领导人选举在这个时候是在所有可能的。遵循具有建议的算法框架,这些信息在开始时由知道整个网络的预言机提供给所有节点。这个字符串的长度(它的位数)称为通知的大小。对于一个给定的时间$τ$分配给领导选举,我们给出了上界和下界的最小尺寸的建议足以执行领导选举的时间$τ$。我们专注于时间谱的两侧,并对这些极端情况的最小建议大小给出严格(或几乎严格)的界限。我们还表明,不断的建议是不够的领导人选举在所有的图,无论分配的时间。
英文摘要:
Leader election is one of the basic problems in distributed computing. For anonymous networks, the task of leader election is formulated as follows: every node v of the network must output a simple path, which is coded as a sequence of port numbers, such that all these paths end at a common node, the leader. In this paper, we study deterministic leader election in arbitrary anonymous networks. It is well known that leader election is impossible in some networks, regardless of the allocated amount of time, even if nodes know the map of the network. However, even in networks in which it is possible to elect a leader knowing the map, the task may be still impossible without any knowledge, regardless of the allocated time. On the other hand, for any network in which leader election is possible knowing the map, there is a minimum time, called the election index, in which this can be done. Informally, the election index of a network is the minimum depth at which views of all nodes are distinct. Our aim is to establish tradeoffs between the allocated time $τ$ and the amount of information that has to be given a priori to the nodes to enable leader election in time $τ$ in all networks for which leader election in this time is at all possible. Following the framework of algorithms with advice, this information is provided to all nodes at the start by an oracle knowing the entire network. The length of this string (its number of bits) is called the size of advice. For a given time $τ$ allocated to leader election, we give upper and lower bounds on the minimum size of advice sufficient to perform leader election in time $τ$. We focus on the two sides of the time spectrum and give tight (or almost tight) bounds on the minimum size of advice for these extremes. We also show that constant advice is not sufficient for leader election in all graphs, regardless of the allocated time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。