On the complexity of fault-tolerant consensus
On the complexity of fault-tolerant consensus
复制标题
论容错共识的复杂性
DOI：
10.1007/978-3-030-31277-0_2
复制
发表时间：
2019
影响因子：
3.1
通讯作者：
Jaroslaw Mirek
中科院分区：
文献类型：
--
作者：
D. Kowalski;Jaroslaw Mirek
该论文研究了在分布式消息的系统中达成协议的问题，容易出现崩溃故障。崩溃是由\ Condented \对手生成的-A \ Wadapt \ Aversary，他必须提前修复$ f $ crast -crash -crast -prone流程或\ Chainadapt \对手并在撞车时必须遵循此模式。除了这些限制外，它们都可能随时以自适应方式崩溃。虽然常用\ sadapt \对手模型攻击和\ noadapt \ ess-预定义的故障，但受约束的对手模型在存在依赖性依赖性的过程（例如层次结构或可靠的软件/硬件系统）时，更现实的场景。我们提出针对此类对手的时间效率共识算法，并展示如何提高提议解决方案的信息复杂性。最后，我们展示了如何对\ kthick \对手达成共识，受任意的部分顺序\ dk {具有最大的反链$ k $}。我们将算法结果与（几乎）紧密的下限进行补充，并将其扩展为\ wadapt \对手，也可以（语法上）弱\ noadapt \对手。以及针对\ wadapt \对手的共识算法（自动转化为\ noadapt \对手），这些结果扩展了流行的\ noadapt \ verseries的最新阶段，尤其是Chor的结果，Meritt，Meritt，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.