文章基本信息

标题：Coordination-Free Byzantine Replication with Minimal Communication Costs
本地全文：下载
作者：Jelle Hellings ; Mohammad Sadoghi
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2020
卷号：155
页码：17:1-17:20
DOI：10.4230/LIPIcs.ICDT.2020.17
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Byzantine learner; coordination-free checkpoint protocol; delayed-replication; information dispersal; consensus