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

论容错共识的复杂性

On the complexity of fault-tolerant consensus

Dariusz R. Kowalski, Jaroslaw Mirek

摘要:

研究了分布式消息传递系统中容易发生崩溃故障的协议达成问题。崩溃是由\constrained \ adversaries生成的-\wadapt \adversaries必须提前修复$f$易崩溃进程集,或者\chainadapt \adversaries将所有进程命令为$k$不相交链,并且在崩溃时必须遵循此模式。除了这些限制之外,它们都可能在任何时候以自适应的方式崩溃进程。虽然常用的\sadapt \adverses模型攻击和\noadapt \ ones -预定义的故障,但当存在故障倾向的依赖过程时,受约束的对手模型更现实的场景,例如,在分层或可靠的软件/硬件系统中。我们提出了针对这些对手的时间效率的共识算法,并展示了如何提高所提出的解决方案的消息的复杂性。最后,我们展示了如何达成共识,对\kthick \对手,限制了任意偏序\dk{with a maximal anti-chain of length $k$}。我们补充我们的算法结果与(几乎)紧的下限,并延长\wadapt \adverses持有(语法)较弱的\noadapt \adverses。与针对\wadapt \ adversaries的共识算法一起使用(其自动翻译为\noadapt \ adversaries),这些结果扩展了流行的\noadapt \ adversaries类的最新技术水平,特别是Chor、Meritt和Shmoys~ \cite{CMS}的结果,并证明了\sadapt \和受约束对手之间的一般分离(包括\noadapt)由Bar-Joseph和Ben-Or~ \cite{BB}和其他人分析。

英文摘要:

The paper studies the problem of reaching agreement in a distributed message-passing system prone to crash failures. Crashes are generated by \constrained\ adversaries - a \wadapt\ adversary, who has to fix in advance the set of $f$ crash-prone processes, or a \chainadapt\ adversary, who orders all the processes into $k$ disjoint chains and has to follow this pattern when crashing them. Apart from these constraints, both of them may crash processes in an adaptive way at any time. While commonly used \sadapt\ adversaries model attacks and \noadapt\ ones -- pre-defined faults, the constrained adversaries model more realistic scenarios when there are fault-prone dependent processes, e.g., in hierarchical or dependable software/hardware systems. We propose time-efficient consensus algorithms against such adversaries and also show how to improve the message complexity of proposed solutions. Finally, we show how to reach consensus against a \kthick\ adversary, limited by an arbitrary partial order \dk{with a maximal anti-chain of length $k$}. We complement our algorithmic results with (almost) tight lower bounds, and extend the one for \wadapt\ adversaries to hold also for (syntactically) weaker \noadapt\ adversaries. Together with the consensus algorithm against \wadapt\ adversaries (which automatically translates to \noadapt\ adversaries), these results extend the state-of-the-art of the popular class of \noadapt\ adversaries, in particular the result of Chor, Meritt and Shmoys~\cite{CMS}, and prove general separation between \sadapt\ and the constrained adversaries (including \noadapt) analyzed by Bar-Joseph and Ben-Or~\cite{BB} and others.

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

↑