Evaluating Byzantine Quorum Systems
Evaluating Byzantine Quorum Systems
复制标题
评估拜占庭仲裁系统
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
M. Correia
中科院分区：
文献类型：
--
作者：
W. Dantas;A. Bessani;J. Fraga;M. Correia
复制是一种广泛用于保证数据存储服务可用性和良好性能的机制。拜占庭仲裁系统（BQS）已经被提出作为一种解决方案来保证这类服务的一致性，即使一些副本任意失败。最近提出了许多BQS，但比较它们的性能并不简单。事实上，已经有研究表明，像步数或通信轮数这样的理论指标对分布式算法的实际性能的影响与它们所隐藏的一样多。本文对文献中几种BQS算法进行了比较评价。评估是基于实验和模拟。为此，开发了一个名为BQSNeko的BQS评估框架。评估的结果允许更好地理解算法和所涉及的权衡。
Replication is a mechanism extensively used to guarantee the availability and good performance of data storage services. Byzantine Quorum Systems (BQS) have been proposed as a solution to guarantee the consistency of that kind of services, even if some of the replicas fail arbitrarily. Many BQS have been proposed recently, but comparing their performance is not simple. In fact, it has been shown that theoretical metrics like the number of steps or communication rounds say as much about the practical performance of distributed algorithms as they hide. This paper presents a comparative evaluation of several BQS algorithms in the literature. The evaluation is based both on experiments and simulations. For that purpose, a framework for evaluating BQS called BQSNeko was developed. The results of the evaluation allow a better understanding of the algorithms and the tradeoffs involved.