20212021 International Conference on Computer Engineering and Application (ICCEA)Requires access

Classification of Blockchain Consensus Mechanisms Based on PBFT Algorithm

Bo Gan, QiWu Wu, Xiang Li, Yang Zhou

Open publisher page 10 citations

Abstract

Blockchain is a solution for transmission, distribution and decentralized storage of data, the core of which lies in the way to reach consensuses among distributed nodes under trustless environments. Practical Byzantine Fault Tolerance (PBFT) is one of the most popular blockchain consensus mechanisms used nowadays, especially in consortium blockchain. To improve the performance of PBFT, many works have been done since early years. This paper proposes a novel classification approach of improved PBFT algorithms and summarizes several performance indicators of them. The work aims to offer reference for further innovation upon blockchain consensus mechanisms based on improved PBFT under variant circumstances.

About this research paper

What this paper is about

Blockchain is a solution for transmission, distribution and decentralized storage of data, the core of which lies in the way to reach consensuses among distributed nodes under trustless environments. Practical Byzantine Fault Tolerance (PBFT) is one of the most popular blockchain consensus mechanisms used nowadays, especially in consortium blockchain. To improve the performance of PBFT, many works have been done since early years. This paper proposes a novel classification approach of improved PBFT algorithms and summarizes several performance indicators of them. The work aims to offer reference for further innovation upon blockchain consensus mechanisms based on improved PBFT under variant circumstances.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Blockchain is a solution for transmission, distribution and decentralized storage of data, the core of which lies in the way to reach consensuses among distributed nodes under trustless environments. Practical Byzantine Fault Tolerance (PBFT) is one of the most popular blockchain consensus mechanisms used nowadays, especially in consortium blockchain. To improve the performance of PBFT, many works have been done since early years. This paper proposes a novel classification approach of improved PBFT algorithms and summarizes several performance indicators of them. The work aims to offer reference for further innovation upon blockchain consensus mechanisms based on improved PBFT under variant circumstances.

Key concepts: Blockchain, Byzantine fault tolerance, Consensus algorithm, Computer science, Distributed computing, Fault tolerance, Algorithm, Computer security

Related papers

Back to paper searchBrowse research topicsOriginal source
Classification of Blockchain Consensus Mechanisms Based on PBFT Algorithm — Research Paper | ScholarLens