Coordination-Free Byzantine Replication with Minimal Communication Costs
Coordination-Free Byzantine Replication with Minimal Communication Costs
复制标题
具有最小通信成本的无协调拜占庭复制
DOI：
10.4230/lipics.icdt.2020.17
复制
发表时间：
2020
影响因子：
8.7
通讯作者：
Mohammad Sadoghi
中科院分区：
文献类型：
--
作者：
Jelle Hellings;Mohammad Sadoghi
最先进的容错和联合数据管理系统依赖于完全复制的设计，在这种设计中，所有参与者都具有同等的角色。因此，这些系统的可伸缩性有限，不适合高性能数据管理。作为另一种选择，我们提出了一种分层设计，其中拜占庭集群管理数据，而任意数量的学习者可以可靠地学习这些更新并使用相应的数据。
为了实现我们的设计，我们提出了延迟复制算法，这是对拜占庭学习者问题的一种有效解决方案，这是我们设计的核心。延迟复制算法是无协调的、可扩展的，并且对所有参与者来说具有最小的通信成本。通过这样做，延迟广播算法为新的高性能容错和联合数据管理系统打开了大门。为了说明这一点，我们证明了延迟复制算法不仅有助于支持专业学习者，还可以用于降低允许区块链的总体通信成本和提高其存储可伸缩性。
State-of-the-art fault-tolerant and federated data management systems rely on fully-replicated designs in which all participants have equivalent roles. Consequently, these systems have only limited scalability and are ill-suited for high-performance data management. As an alternative, we propose a hierarchical design in which a Byzantine cluster manages data, while an arbitrary number of learners can reliable learn these updates and use the corresponding data.
To realize our design, we propose the delayed-replication algorithm, an efficient solution to the Byzantine learner problem that is central to our design. The delayed-replication algorithm is coordination-free, scalable, and has minimal communication cost for all participants involved. In doing so, the delayed-broadcast algorithm opens the door to new high-performance fault-tolerant and federated data management systems. To illustrate this, we show that the delayed-replication algorithm is not only useful to support specialized learners, but can also be used to reduce the overall communication cost of permissioned blockchains and to improve their storage scalability.
DOI：
10.1109/icde.2019.00020
发表时间：
2019-04
期刊：
2019 IEEE 35th International Conference on Data Engineering (ICDE)
影响因子：
--
作者：
Faisal Nawab;Mohammad Sadoghi
通讯作者：
Faisal Nawab;Mohammad Sadoghi
DOI：
10.1145/2168836.2168866
发表时间：
2012-04
期刊：
--
影响因子：
--
作者：
R. Kapitza;J. Behl;C. Cachin;T. Distler;Simon Kuhnle;Seyed Vahid Mohammadi;Wolfgang Schröder-Preikschat;Klaus Stengel
通讯作者：
R. Kapitza;J. Behl;C. Cachin;T. Distler;Simon Kuhnle;Seyed Vahid Mohammadi;Wolfgang Schröder-Preikschat;Klaus Stengel