Improvement of blockchain practical Byzantine fault tolerance consensus algorithm

doi:10.11772/j.issn.1001-9081.2018112343

Journal of Computer Applications ›› 2019, Vol. 39 ›› Issue (7): 2148-2155.DOI: 10.11772/j.issn.1001-9081.2018112343

• Frontier & interdisciplinary applications • Previous Articles Next Articles

Improvement of blockchain practical Byzantine fault tolerance consensus algorithm

GAN Jun, LI Qiang, CHEN Zihao, ZHANG Chao

College of Computer Science, Sichuan University, Chengdu Sichuan 610065, China

Received:2018-11-26 Revised:2019-01-12 Online:2019-07-10 Published:2019-07-15
Supported by:
This work is partially supported by the Key Project of Science and Technology Department of Sichuan Province (2018GZ0105, 2018GZ0104).

区块链实用拜占庭容错共识算法的改进

甘俊, 李强, 陈子豪, 张超

四川大学计算机学院, 成都 610065

通讯作者: 李强
作者简介:甘俊(1997-),男,四川内江人,硕士研究生,CCF会员,主要研究方向:区块链;李强(1963-),男,四川成都人,副教授,博士,主要研究方向:移动云计算、大数据、区块链;陈子豪(1995-),男,四川成都人,硕士研究生,主要研究方向:区块链;张超(1993-),男,山东日照人,硕士研究生,主要研究方向:区块链。
基金资助:
四川省科技厅重点项目（2018GZ0105，2018GZ0104）。

Abstract

Abstract:

Since Practical Byzantine Fault Tolerance (PBFT) consensus algorithm applied to the alliance chain has the problems of static network structure, random selection of master node and large communication overhead, an Evolution of Practical Byzantine Fault Tolerance (EPBFT) consensus algorithm was proposed. Firstly, a series of activity states were set for consensus nodes, making the nodes have complete life cycle in the system through state transition, so that the nodes were able to dynamically join and exit while the system has a dynamic network structure. Secondly, the selection method of master node of PBFT was improved with adding the election process of master node with the longest chain as the election principle. After the election of master node, the reliability of master node was further ensured through data synchronization and master node verification process. Finally, the consensus process of PBFT algorithm was optimized to improve the consensus efficiency, thus the communication overhead of EPBFT algorithm was reduced to 1/2 of that of PBFT algorithm with little view changes. The experimental results show that EPBFT algorithm has good effectiveness and practicability.

Key words: Practical Byzantine Fault Tolerance (PBFT), alliance chain, master node, election

摘要：

针对应用于联盟链的实用拜占庭容错（PBFT）共识算法网络结构静态、主节点选取随意和通信开销较大的问题，提出了一种改进的实用拜占庭容错（EPBFT）共识算法。首先，给共识节点设置一系列活动状态使得节点通过状态转换在系统中拥有完整生命周期，由此节点可以动态地加入和退出，系统拥有动态的网络结构。其次，对PBFT的主节点选取方式加以改进，增加以最长链为选举原则的主节点选举过程。在主节点选举完成之后，通过数据同步和主节点验证过程进一步保证主节点的可信性。最后，优化PBFT算法的共识流程以提高共识效率，使得EPBFT算法的通信开销在视图变更较少发生的情况下降低为PBFT算法的1/2。实验结果表明，EPBFT算法具有较好的有效性和实用性。

关键词: 实用拜占庭容错, 联盟链, 主节点, 选举

CLC Number:

TP311.5

GAN Jun, LI Qiang, CHEN Zihao, ZHANG Chao. Improvement of blockchain practical Byzantine fault tolerance consensus algorithm[J]. Journal of Computer Applications, 2019, 39(7): 2148-2155.

甘俊, 李强, 陈子豪, 张超. 区块链实用拜占庭容错共识算法的改进[J]. 计算机应用, 2019, 39(7): 2148-2155.

References

[1] BONNEAU J, MILLER A, CLARK J, et al. SoK:research perspectives and challenges for bitcoin and cryptocurrencies[C]//Proceedings of the 2015 IEEE Symposium on Security and Privacy. Washington, DC:IEEE Computer Society, 2015:104-121.
[2] 蔡维德,郁莲,王荣,等.基于区块链的应用系统开发方法研究[J].软件学报,2017,28(6):1474-1487.(CAI W D, YU L, WANG R, et al. Blockchain application development techniques[J]. Journal of Software, 2017, 28(6):1474-1487.)
[3] EYAL I, CENCER A E, SIRER E G, et al. Bitcoin-NG:a scalable blockchain protocol[C]//Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation. Berkeley, CA:USENIX Association, 2016:45-59.
[4] AMALARETHINAM D I G, BALAKRISHNAN C, CHARLES A. An improved methodology for fragment re-allocation in peer-to-peer distributed databases[C]//Proceedings of the 4th International Conference on Advances in Recent Technologies in Communication and Computing. Piscataway, NJ:IEEE, 2012:78-81.
[5] PEASE M, SHOSTAK R, LAMPORT L. Reaching agreement in the presence of faults[J]. Journal of the ACM, 1980, 27(2):228-234.
[6] LAMPORT L, SHOSTAK R, PEASE M. The Byzantine generals problem[J]. ACM Transactions on Programming Languages and Systems, 1982, 4(3):382-401.
[7] LI J R, WOLF T. A one-way proof-of-work protocol to protect controllers in software-defined networks[C]//Proceedings of the 2016 Symposium on Architectures for Networking and Communications Systems. New York:ACM, 2016:123-124.
[8] CASTRO M, LISKOV B. Practical Byzantine fault tolerance[C]//Proceedings of the 3rd Symposium on Operating Systems Design and Implementation. Berkeley, CA:USENIX Association, 1999:173-186.
[9] REITER M K. A secure group membership protocol[J]. IEEE Transactions on Software Engineering, 1996, 22(1):31-42.
[10] JUNQUEIRA F, REED B. ZooKeeper分布式过程协同技术详解[M].谢超,周贵卿,译.北京:机械工业出版社,2016:188-193.(JUNQUEIRA F, REED B. Detailed Explanation of Zookeeper Distributed Process Collaboration Technology[M]. XIE C, ZHOU G Q, translated. Beijing:China Machine Press, 2016:188-193.)
[11] 袁勇,王飞跃.区块链技术发展现状与展望[J].自动化学报,2016,42(4):481-494.(YUAN Y, WANG F Y. Blockchain:the state of the art and future trends[J]. Acta Automatica Sinica, 2016, 42(4):481-494.)
[12] 韩璇,刘亚敏.区块链技术中的共识机制研究[J].信息网络安全,2017(9):147-152.(HAN X, LIU Y M. Research on the consensus mechanisms of blockchain technology[J]. Netinfo Security, 2017(9):147-152.)
[13] LAMPORT L. The part-time parliament[J]. ACM Transactions on Computer Systems, 1998, 16(2):133-169.
[14] ONGARO D, OUSTERHOUT J. In search of an understandable consensus algorithm[C]//Proceedings of the 2014 USENIX Annual Technical Conference. Berkeley, CA:USENIX Association, 2014:305-319.
[15] COWLING J, MYERS D, LISKOV B, et al. HQ replication:a hybrid quorum protocol for Byzantine fault tolerance[C]//Proceedings of the 7th Symposium on Operating Systems Design and Implementation. Berkeley, CA:USENIX Association, 2006:177-190.
[16] COPELAND C, ZHONG H. Tangaroa:a Byzantine fault tolerant raft[EB/OL].[2018-10-25]. http://www.scs.stanford.edu/14aucs244b/labs/projects/copelandzhong.pdf.
[17] MARTINO W. KADENA:the first scalable, high performance private blockchain[EB/OL].[2018-10-25]. http://kadena.io/docs/KadenaConsensusWhitePaperAug2016.pdf.
[18] KWON J. Tendermint:consensus without mining[EB/OL].[2018-10-25].https://tendermint.com/static/docs/tendermint.pdf.
[19] GILAD Y, HEMO R, MICALI S, et al. Scaling Byzantine agreements for cryptocurrencies[EB/OL].[2018-10-25]. http://eprint.iacr.org/2017/454.
[20] QUANTUM M. Proof of stake[EB/OL].[2018-10-25]. https://en.bitcoin.it/wiki/Proof of Stake.

Improvement of blockchain practical Byzantine fault tolerance consensus algorithm

区块链实用拜占庭容错共识算法的改进

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

[1]	ZHAN Hang, HE Lang, HUANG Zhangcan, LI Huafeng, ZHANG Qiang, TAN Qing. Improved feature selection and classification algorithm for gene expression programming based on layer distance [J]. Journal of Computer Applications, 2021, 41(9): 2658-2667.
[2]	ZHU Cheng, ZHAO Xiaoqi, ZHAO Liping, JIAO Yuhong, ZHU Yafei, CHENG Jianying, ZHOU Wei, TAN Ying. Classification of functional magnetic resonance imaging data based on semi-supervised feature selection by spectral clustering [J]. Journal of Computer Applications, 2021, 41(8): 2288-2293.
[3]	LI Mengmeng, QIN Wei, LIU Yi, DIAO Xingchun. Hybrid ant colony optimization algorithm with brain storm optimization [J]. Journal of Computer Applications, 2021, 41(8): 2412-2417.
[4]	YANG Longhai, WANG Xueyuan, JIANG Hesong. Blockchain digital signature scheme with improved SM2 signature method [J]. Journal of Computer Applications, 2021, 41(7): 1983-1988.
[5]	SHI Anni, LI Taoshen, WANG Zhe, HE Lu. Relay selection strategy for cache-aided full-duplex simultaneous wireless information and power transfer system [J]. Journal of Computer Applications, 2021, 41(6): 1539-1545.
[6]	WANG Xiaorong, ZHANG Yuzhao, ZHANG Zhenjiang. Selection of express freight transportation schemes based on rough set over two universes [J]. Journal of Computer Applications, 2021, 41(5): 1500-1505.
[7]	LIN Junchao, WAN Yuan. Self-adaptive multi-measure unsupervised feature selection method with structured graph optimization [J]. Journal of Computer Applications, 2021, 41(5): 1282-1289.
[8]	JIA Heming, JIANG Zichao, LI Yao, SUN Kangjian. Simultaneous feature selection optimization based on improved spotted hyena optimizer algorithm [J]. Journal of Computer Applications, 2021, 41(5): 1290-1298.
[9]	Gangzhu QIAO, Rui WANG, Chaoli SUN. Improved high-dimensional many-objective evolutionary algorithm based on decomposition [J]. Journal of Computer Applications, 2021, 41(11): 3097-3103.
[10]	Zhichao LI, Tohti TURDI, Hamdulla ASKAR. Answer selection model based on dynamic attention and multi-perspective matching [J]. Journal of Computer Applications, 2021, 41(11): 3156-3163.
[11]	ZHANG Zhihao, LIN Yaojin, LU Shun, GUO Chen, WANG Chenxi. Multi-label feature selection based on label-specific feature with missing labels [J]. Journal of Computer Applications, 2021, 41(10): 2849-2857.
[12]	HAO Pengfei, CHI Rui, QU Zhijian, TU Hongbin, CHI Xuexin, ZHANG Diyou. Improved grey wolf optimizer for location selection problem of railway logistics distribution center [J]. Journal of Computer Applications, 2021, 41(10): 2905-2911.
[13]	ZHOU Xiang, ZHAI Junhai, HUANG Yajie, SHEN Ruicai, HOU Yingzhen. Instance selection algorithm for big data based on random forest and voting mechanism [J]. Journal of Computer Applications, 2021, 41(1): 74-80.
[14]	GU Tong, XU Guoliang, LI Wanlin, LI Jiahao, WANG Zhiyuan, LUO Jiangtao. Intelligent house price evaluation model based on ensemble LightGBM and Bayesian optimization strategy [J]. Journal of Computer Applications, 2020, 40(9): 2762-2767.
[15]	HUANG Xueyu, XU Haote, TAO Jianwen. Multi-source adaptation classification framework with feature selection [J]. Journal of Computer Applications, 2020, 40(9): 2499-2506.