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

易发生链路故障网络中的断连共识

Disconnected Agreement in Networks Prone to Link Failures

Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski, Jedrzej Olkowski

AI总结:

研究同步网络在链路故障下的断连共识问题,提出拉伸概念并设计多种基于拉伸的快速与早停算法,同时给出性能下界证明。

摘要:

我们考虑在任意拓扑结构的同步网络中达成共识的确定性分布式算法。链路是双向的且易发生故障,而节点始终保持非故障状态。故障链路可能会遗漏消息。节点间的共识被理解为在通过移除故障链路而获得的网络的每个连通分量中均成立。我们将达成此类共识的算法问题称为“断连共识”。我们引入了拉伸的概念,即通过移除故障链路获得的网络的连通分量数量减去1再加上各连通分量直径之和。我们通过参考拉伸来定义断连共识的“快速”和“早停”算法概念。网络具有n个节点和m条链路。通常假设节点知道自身的名称,并具备将通信与本地端口关联的能力。如果我们额外假设所有节点都已知拉伸的上界Λ,那么存在一种断连共识算法,其运行时间为O(Λ),使用的消息大小为O(log n)位。我们给出了一种通用的断连共识算法,在n+1轮内运行,使用O(log n)位的消息。设λ为执行过程中发生的未知拉伸;我们给出一种运行时间为(λ+2)^3且使用O(n log n)位消息的算法。我们证明,断连共识可以在最优的O(λ)时间内解决,但代价是将消息大小增加至O(m log n)。我们还设计了一种仅使用O(n)条非故障链路且运行时间为O(n m)的算法,其中节点初始时将其端口映射到邻居,且消息携带O(m log n)位。我们证明了断连共识解决方案性能的下界,这些下界与不断演化的网络拓扑参数及节点可用的知识相关。

英文摘要:

We consider deterministic distributed algorithms for reaching agreement in synchronous networks of arbitrary topologies. Links are bi-directional and prone to failures while nodes stay non-faulty at all times. A faulty link may omit messages. Agreement among nodes is understood as holding in each connected component of a network obtained by removing faulty links. We call ``disconnected agreement'' the algorithmic problem of reaching such agreement. We introduce the concept of stretch, which is the number of connected components of a network, obtained by removing faulty links, minus~$1$ plus the sum of diameters of connected components. We define the concepts of ``fast'' and ``early-stopping'' algorithms for disconnected agreement by referring to stretch. A network has $n$ nodes and $m$ links. Nodes are normally assumed to know their own names and ability to associate communication with local ports. If we additionally assume that a bound~$Λ$ on stretch is known to all nodes, then there is an algorithm for disconnected agreement working in time $O(Λ)$ using messages of $O(\log n)$ bits. We give a general disconnected agreement algorithm operating in~$n+1$ rounds that uses messages of $O(\log n)$ bits. Let~$λ$ be an unknown stretch occurring in an execution; we give an algorithm working in time~$(λ+2)^3$ and using messages of $O(n\log n)$ bits. We show that disconnected agreement can be solved in the optimal $O(λ)$ time, but at the cost of increasing message size to~$O(m\log n)$. We also design an algorithm that uses only~$O(n)$ non-faulty links and works in time~$O(n m)$, while nodes start with their ports mapped to neighbors and messages carry $O(m\log n)$ bits. We prove lower bounds on the performance of disconnected-agreement solutions that refer to the parameters of evolving network topologies and the knowledge available to nodes.

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

↑