Small byzantine quorum systems
Small byzantine quorum systems
复制标题
小型拜占庭法定人数系统
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
M. Dahlin
中科院分区：
文献类型：
--
作者：
Jean;L. Alvisi;M. Dahlin
在本文中，我们提出了两个协议的异步拜占庭仲裁系统（BQS）建立在可靠的通道上的自我验证数据和其他任何数据。我们的协议容忍F拜占庭故障与F少服务器比现有的解决方案，通过消除不必要的工作，在写协议，并通过使用不同大小的读写定额。由于在不可靠的网络上设计可靠的网络层是困难的，因此必须探索其他两种可能性。第一个是通过允许使用超时的同步网络来识别故障的链路或机器来加强模型。我们考虑运行同步和异步拜占庭仲裁协议同步网络，并得出结论，令人惊讶的是，“自定时”异步拜占庭协议可以提供显着的优势，许多同步网络时，网络超时时间很长。我们将展示如何扩展现有的拜占庭仲裁协议，以消除其对可靠网络的依赖，并明确处理消息丢失和重传。
In this paper we present two protocols for asynchronous Byzantine quorum systems (BQS) built on top of reliable channels-one for self-verifying data and the other for any data. Our protocols tolerate f Byzantine failures with f fewer servers than existing solutions by eliminating nonessential work in the write protocol and by using read and write quorums of different sizes. Since engineering a reliable network layer on an unreliable network is difficult, two other possibilities must be explored. The first is to strengthen the model by allowing synchronous networks that use time-outs to identify failed links or machines. We consider running synchronous and asynchronous Byzantine quorum protocols over synchronous networks and conclude that, surprisingly, "self-timing" asynchronous Byzantine protocols may offer significant advantages for many synchronous networks when network time-outs are long. We show how to extend an existing Byzantine quorum protocol to eliminate its dependency on reliable networking and to handle message loss and retransmission explicitly.