Research on Practical Byzantine Fault Tolerant Consensus Algorithm Based on Blockchain

36Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Practical Byzantine Fault-tolerant Algorithm (PBFT) is the most widely used consensus algorithm in alliance chain, which has the advantages of fault tolerance and large throughput. However, PBFT also has some problems that can't be ignored in specific blockchain applications, such as bad behavior of master node, high network communication overhead and low system flexibility. In this paper, the improvement measures of PBFT consensus algorithm are summarized from many aspects, and then compared with traditional PBFT algorithm. Finally, the development direction and trend of PBFT algorithm are prospected, hoping to provide reference for the research and innovation of PBFT consensus algorithm in the future.

Cite

CITATION STYLE

APA

Zheng, X., & Feng, W. (2021). Research on Practical Byzantine Fault Tolerant Consensus Algorithm Based on Blockchain. In IOP Conference Series: Earth and Environmental Science (Vol. 1802). IOP Publishing Ltd. https://doi.org/10.1088/1742-6596/1802/3/032022

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free