无领导原子广播的双有向图方法（扩展版）
A Dual Digraph Approach for Leaderless Atomic Broadcast (Extended Version)
摘要：
许多分布式系统工作在一个公共的共享状态;在这样的系统中，分布式协议是必要的一致性。随着服务器数量的增加，这些系统变得更容易受到单服务器故障的影响，从而增加了容错的相关性。原子广播使容错分布式协议，但它是昂贵的解决。大多数实用的算法需要对每个广播消息进行线性工作。AllAccuur--一种无领导的方法--通过稀疏的弹性覆盖网络连接服务器来减少工作量;然而，这种弹性需要冗余，限制了工作量的减少。在本文中，我们提出了一种原子广播算法AllAccuur+，它解除了这一限制：在没有故障的间隔期间，它通过使用无冗余的覆盖网络实现了最小的工作。当发生故障时，它会通过切换到弹性覆盖网络自动恢复。在我们对非故障场景的性能评估中，AllConcur+实现了与AllGather（一种非容错分布式协议算法）相当的吞吐量，并且在吞吐量和延迟方面都优于AllConcur、LCR和Libpaxos。此外，我们对故障场景的评估表明，AllAccuur+的预期性能对于偶尔的故障是稳健的。因此，对于实际用例，在没有故障的间隔期间利用无冗余分布式协议可以显著提高性能。
英文摘要：
Many distributed systems work on a common shared state; in such systems, distributed agreement is necessary for consistency. With an increasing number of servers, these systems become more susceptible to single-server failures, increasing the relevance of fault-tolerance. Atomic broadcast enables fault-tolerant distributed agreement, yet it is costly to solve. Most practical algorithms entail linear work per broadcast message. AllConcur -- a leaderless approach -- reduces the work, by connecting the servers via a sparse resilient overlay network; yet, this resiliency entails redundancy, limiting the reduction of work. In this paper, we propose AllConcur+, an atomic broadcast algorithm that lifts this limitation: During intervals with no failures, it achieves minimal work by using a redundancy-free overlay network. When failures do occur, it automatically recovers by switching to a resilient overlay network. In our performance evaluation of non-failure scenarios, AllConcur+ achieves comparable throughput to AllGather -- a non-fault-tolerant distributed agreement algorithm -- and outperforms AllConcur, LCR and Libpaxos both in terms of throughput and latency. Furthermore, our evaluation of failure scenarios shows that AllConcur+'s expected performance is robust with regard to occasional failures. Thus, for realistic use cases, leveraging redundancy-free distributed agreement during intervals with no failures improves performance significantly.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
