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.
Efficient and Simple Algorithms for Fault Tolerant Spanners
最近表明,一个版本的贪心算法给出了一个结构的容错空间是大小最优的,至少对于顶点故障。然而,构造该时间序列的算法不是多项式时间的,并且最著名的多项式时间算法明显是次优的。设计一个多项式时间算法来构造(近)最优的容错空间是最近两篇关于容错空间的论文([Bodwin,Dinitz,Parter,Vassilevka Williams SODA '18]和[Bodwin,Patel PODC '19])中的一个公开问题。我们给出了一个令人惊讶的简单算法,在多项式时间内运行,并通过修改贪心算法运行在多项式时间,构造非常接近最优的容错spectrum(关闭只有一个线性因子的拉伸)。为了补充这一结果,我们还给出了简单的分布式结构的两个模型的CONGEST和CONGEST。