论文标题
Alea-Bft：实用异步拜占庭式容错
Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance
论文作者
论文摘要
传统的拜占庭式容错（BFT）状态机器复制协议假定部分同步模型，从而导致设计领导者复制品驱动协议并在超时后替换。最近，我们目睹了异步BFT协议的激增，这些协议使用随机化来删除消息传递时间的界限假设，从而使它们对不良网络条件更具弹性。但是，由于它们的立方交流成本，昂贵的原始功能以及整体协议的复杂性，这些协议仍然无法在各种场景中实用。在本文中，我们介绍了Alea-BFT，这是第一个达到二次通信复杂性的异步BFT协议，从而使其可以扩展到大型网络。 Alea-bft带来了从单个指定复制品集中工作的经典协议中的关键设计见解，并将这一原理纳入了两个阶段的管道设计的设计中，并由指定的副本领导的有效广播，然后是廉价的二进制协议。我们评估了我们在四大洲的10个地点的原型实施，我们的结果显示了拟议设计中的可伸缩性增长。
Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and is replaced after a timeout. Recently, we witnessed a surge of asynchronous BFT protocols that use randomization to remove the assumptions of bounds on message delivery times, making them more resilient to adverse network conditions. However, these protocols still fall short of being practical across a broad range of scenarios due to their cubic communication costs, use of expensive primitives, and overall protocol complexity. In this paper, we present Alea-BFT, the first asynchronous BFT protocol to achieve quadratic communication complexity, allowing it to scale to large networks. Alea-BFT brings the key design insight from classical protocols of concentrating part of the work on a single designated replica, and incorporates this principle in a two stage pipelined design, with an efficient broadcast led by the designated replica followed by an inexpensive binary agreement. We evaluated our prototype implementation across 10 sites in 4 continents, and our results show significant scalability gains from the proposed design.
