Workload-based randomization byzantine fault tolerance consensus protocol
This paper introduces a new Byzantine fault tolerance protocol called workload-based randomization Byzantine fault tolerance protocol (WRBFT). Improvements are made to the Practical Byzantine Fault Tolerance (PBFT), which has an important position in the Byzantine Fault consensus algorithm. Although...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2022-09-01
|
| Series: | High-Confidence Computing |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2667295222000228 |
| _version_ | 1811284173693911040 |
|---|---|
| author | Baohua Huang Li Peng Weihong Zhao Ningjiang Chen |
| author_facet | Baohua Huang Li Peng Weihong Zhao Ningjiang Chen |
| author_sort | Baohua Huang |
| collection | DOAJ |
| description | This paper introduces a new Byzantine fault tolerance protocol called workload-based randomization Byzantine fault tolerance protocol (WRBFT). Improvements are made to the Practical Byzantine Fault Tolerance (PBFT), which has an important position in the Byzantine Fault consensus algorithm. Although PBFT has numerous advantages, its primary node selection mechanism is overly fixed, the communication overhead of the consensus process is also high, and nodes cannot join and exit dynamically. To solve these problems, the WRBFT proposed in this paper combines node consensus workload and verifiable random function (VRF) to randomly select the more reliable primary node that dominates the consensus. The selection of the nodes involved in the consensus is based on the node workload, and the optimization of the agreement protocol of the PBFT is also based on this. Simulation results show that the WRBFT has higher throughput, lower consensus latency, and higher algorithmic efficiency compared to the PBFT. |
| first_indexed | 2024-04-13T02:25:46Z |
| format | Article |
| id | doaj.art-8263777e944d4624a4ae8ea420906fae |
| institution | Directory Open Access Journal |
| issn | 2667-2952 |
| language | English |
| last_indexed | 2024-04-13T02:25:46Z |
| publishDate | 2022-09-01 |
| publisher | Elsevier |
| record_format | Article |
| series | High-Confidence Computing |
| spelling | doaj.art-8263777e944d4624a4ae8ea420906fae2022-12-22T03:06:48ZengElsevierHigh-Confidence Computing2667-29522022-09-0123100070Workload-based randomization byzantine fault tolerance consensus protocolBaohua Huang0Li Peng1Weihong Zhao2Ningjiang Chen3Corresponding author.; School of Computer and Electronic Information, Guangxi University, Nanning, ChinaSchool of Computer and Electronic Information, Guangxi University, Nanning, ChinaSchool of Computer and Electronic Information, Guangxi University, Nanning, ChinaSchool of Computer and Electronic Information, Guangxi University, Nanning, ChinaThis paper introduces a new Byzantine fault tolerance protocol called workload-based randomization Byzantine fault tolerance protocol (WRBFT). Improvements are made to the Practical Byzantine Fault Tolerance (PBFT), which has an important position in the Byzantine Fault consensus algorithm. Although PBFT has numerous advantages, its primary node selection mechanism is overly fixed, the communication overhead of the consensus process is also high, and nodes cannot join and exit dynamically. To solve these problems, the WRBFT proposed in this paper combines node consensus workload and verifiable random function (VRF) to randomly select the more reliable primary node that dominates the consensus. The selection of the nodes involved in the consensus is based on the node workload, and the optimization of the agreement protocol of the PBFT is also based on this. Simulation results show that the WRBFT has higher throughput, lower consensus latency, and higher algorithmic efficiency compared to the PBFT.http://www.sciencedirect.com/science/article/pii/S2667295222000228BlockchainConsensus algorithmBFTPBFTVerifiable random function |
| spellingShingle | Baohua Huang Li Peng Weihong Zhao Ningjiang Chen Workload-based randomization byzantine fault tolerance consensus protocol High-Confidence Computing Blockchain Consensus algorithm BFT PBFT Verifiable random function |
| title | Workload-based randomization byzantine fault tolerance consensus protocol |
| title_full | Workload-based randomization byzantine fault tolerance consensus protocol |
| title_fullStr | Workload-based randomization byzantine fault tolerance consensus protocol |
| title_full_unstemmed | Workload-based randomization byzantine fault tolerance consensus protocol |
| title_short | Workload-based randomization byzantine fault tolerance consensus protocol |
| title_sort | workload based randomization byzantine fault tolerance consensus protocol |
| topic | Blockchain Consensus algorithm BFT PBFT Verifiable random function |
| url | http://www.sciencedirect.com/science/article/pii/S2667295222000228 |
| work_keys_str_mv | AT baohuahuang workloadbasedrandomizationbyzantinefaulttoleranceconsensusprotocol AT lipeng workloadbasedrandomizationbyzantinefaulttoleranceconsensusprotocol AT weihongzhao workloadbasedrandomizationbyzantinefaulttoleranceconsensusprotocol AT ningjiangchen workloadbasedrandomizationbyzantinefaulttoleranceconsensusprotocol |