High Performance and Scalable Byzantine Fault Tolerance

2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC) Pub Date : 2019-03-15 DOI:10.1109/ITNEC.2019.8728972

Yanjun Jiang, Zhuang Lian

{"title":"High Performance and Scalable Byzantine Fault Tolerance","authors":"Yanjun Jiang, Zhuang Lian","doi":"10.1109/ITNEC.2019.8728972","DOIUrl":null,"url":null,"abstract":"With the great success of cryptocurrencies, people have paid great attention to blockchain technology and Byzantine fault tolerance (BFT) for consensus. Practical Byzantine Fault Tolerance protocol (PBFT) proposed by Castro and Liskov in 1999 is recognized as the most classic protocol for solving the Byzantine generals problem, but it still has many fatal disadvantages. Firstly, its communication complexity in the consensus process has reached O(n2), so that it can only be applied in a small-scale system. Secondly, it works in a completely enclosed environment, nodes are not allowed to participate or exit the network without restarting the system, making it difficult to get applied in the actual system. In order to solve these problem, this paper proposes the High Performance and Scalable Byzantine Fault Tolerance, an improved BFT protocol, called HSBFT. In normal case operation, the HSBFT’s communication complexity is reduced to O(n), and it also has the ability to be scalable, making it adaptable to more diverse practical scenarios.","PeriodicalId":202966,"journal":{"name":"2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNEC.2019.8728972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

Abstract

With the great success of cryptocurrencies, people have paid great attention to blockchain technology and Byzantine fault tolerance (BFT) for consensus. Practical Byzantine Fault Tolerance protocol (PBFT) proposed by Castro and Liskov in 1999 is recognized as the most classic protocol for solving the Byzantine generals problem, but it still has many fatal disadvantages. Firstly, its communication complexity in the consensus process has reached O(n2), so that it can only be applied in a small-scale system. Secondly, it works in a completely enclosed environment, nodes are not allowed to participate or exit the network without restarting the system, making it difficult to get applied in the actual system. In order to solve these problem, this paper proposes the High Performance and Scalable Byzantine Fault Tolerance, an improved BFT protocol, called HSBFT. In normal case operation, the HSBFT’s communication complexity is reduced to O(n), and it also has the ability to be scalable, making it adaptable to more diverse practical scenarios.

查看原文本刊更多论文

高性能和可扩展的拜占庭容错

随着加密货币的巨大成功，人们对区块链技术和拜占庭容错(BFT)的共识给予了极大的关注。1999年Castro和Liskov提出的实用拜占庭容错协议(Practical Byzantine Fault Tolerance protocol, PBFT)被认为是解决拜占庭将军问题最经典的协议，但它仍然存在许多致命的缺点。首先，它在共识过程中的通信复杂度达到了O(n2)，因此只能应用于小规模的系统。其次，它工作在一个完全封闭的环境中，节点在不重启系统的情况下不允许参与或退出网络，难以在实际系统中应用。为了解决这些问题，本文提出了一种改进的BFT协议HSBFT，即高性能可扩展的拜占庭容错协议。在正常情况下，HSBFT的通信复杂度降低到0 (n)，并且具有可扩展性，能够适应更多样化的实际场景。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)

自引率

0.00%

发文量