有向动态网络的一致性
Agreement in Directed Dynamic Networks
摘要：
我们研究了同步动态网络中的分布式计算，其中一个无所不知的对手控制的单向通信链路。它的行为被建模为一个序列的有向图表示每轮的活动（即及时）的通信链路。我们证明了共识是不可能的一些自然的弱连通性假设下，并引入顶点稳定的根组件作为一种手段来规避这种不可能性。从本质上讲，我们假设有一个很短的时间段，在此期间，网络的任意部分保持强连接，而其互连拓扑可能会不断变化。我们提出了一个共识算法，工作在这个假设下，并证明其正确性。我们的算法保持一个本地估计的通信图，并应用技术检测稳定的网络属性和单价系统配置。我们的可能性结果补充了几个不可能的结果和下界的共识和其他分布式计算问题，如领导人选举，揭示了我们的算法是渐近最优的。
英文摘要：
We study distributed computation in synchronous dynamic networks where an omniscient adversary controls the unidirectional communication links. Its behavior is modeled as a sequence of directed graphs representing the active (i.e. timely) communication links per round. We prove that consensus is impossible under some natural weak connectivity assumptions, and introduce vertex-stable root components as a means for circumventing this impossibility. Essentially, we assume that there is a short period of time during which an arbitrary part of the network remains strongly connected, while its interconnect topology may keep changing continuously. We present a consensus algorithm that works under this assumption, and prove its correctness. Our algorithm maintains a local estimate of the communication graphs, and applies techniques for detecting stable network properties and univalent system configurations. Our possibility results are complemented by several impossibility results and lower bounds for consensus and other distributed computing problems like leader election, revealing that our algorithm is asymptotically optimal.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
