论文标题
使每个单词计数：自适应ba用更少的单词
Make Every Word Count: Adaptive BA with Fewer Words
论文作者
论文摘要
拜占庭协议是许多分布式系统中的关键组成部分。尽管Dolev和Reischuk很久以前就证明了二次交流的复杂性对于最糟糕的情况是必不可少的，但在实际上，在失败较少的情况下实际上可以做什么的问题仍然开放。在本文中，我们介绍了第一个带有$ o（n（f+1））$通信复杂性的拜占庭广播算法，其中$ 0 \ leq f \ leq t $是运行中流程失败的实际数量。对于具有强大一致性的BA，我们提出了第一个最佳富算法，该算法在无故障情况下具有线性通信复杂性，否则二次成本。
Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in practically common runs with fewer failures remained open. In this paper we present the first Byzantine Broadcast algorithm with $O(n(f+1))$ communication complexity, where $0\leq f\leq t$ is the actual number of process failures in a run. And for BA with strong unanimity, we present the first optimal-resilience algorithm that has linear communication complexity in the failure-free case and a quadratic cost otherwise.
