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

回到协同攻击问题

Back to the Coordinated Attack Problem

Emmanuel Godard, Eloi Perdereau

AI总结:

本文在消息对手一般模型下刻画协同攻击问题的障碍,给出组合与拓扑两种证明,并提出相应共识算法,展示拓扑方法在分布式可计算性中的解释力。

摘要:

我们考虑著名的协同攻击问题,其中两位将军必须就共同攻击做出决定,而他们的信使可能被敌人捕获。非正式地说,这个问题代表了在存在通信故障时达成一致的困难。我们这里只考虑遗漏故障(消息丢失),但与以往研究相反,我们不限制消息可能丢失的方式,即我们不做出具体假设,我们不使用特定的故障度量。在消息对手的较大子类中,其中双重同时遗漏永远不会发生,我们刻画了哪些消息对手是协同攻击问题的障碍。我们给出了这个结果的两种证明。一种是组合的,使用经典的二值性技术来证明必要条件。第二种是拓扑的,使用单纯复形来证明必要条件。我们还提出了两种不同的共识算法,它们本质上是组合的(分别为拓扑的)。最后,我们分析了这两个证明,并在消息对手的非常一般的情况下说明了组合方法与拓扑方法之间的关系。我们表明,拓扑刻画更清楚地解释了为什么某些消息对手是障碍或不是障碍。这个结果令人信服地说明了拓扑工具对于分布式可计算性的力量。

英文摘要:

We consider the well known Coordinated Attack Problem, where two generals have to decide on a common attack, when their messengers can be captured by the enemy. Informally, this problem represents the difficulties to agree in the presence of communication faults. We consider here only omission faults (loss of message), but contrary to previous studies, we do not to restrict the way messages can be lost, i.e. we make no specific assumption, we use no specific failure metric. In the large subclass of message adversaries where the double simultaneous omission can never happen, we characterize which ones are obstructions for the Coordinated Attack Problem. We give two proofs of this result. One is combinatorial and uses the classical bivalency technique for the necessary condition. The second is topological and uses simplicial complexes to prove the necessary condition. We also present two different Consensus algorithms that are combinatorial (resp. topological) in essence. Finally, we analyze the two proofs and illustrate the relationship between the combinatorial approach and the topological approach in the very general case of message adversaries. We show that the topological characterization gives a clearer explanation of why some message adversaries are obstructions or not. This result is a convincing illustration of the power of topological tools for distributed computability.

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

↑