RE-BPFT: An Improved PBFT Consensus Algorithm for Consortium Blockchain Based on Node Credibility and ID3-Based Classification
Practical Byzantine Fault Tolerance (PBFT) has been widely used in consortium blockchain systems; however, it suffers from performance degradation and susceptibility to Byzantine faults in complex environments. To overcome these limitations, this paper proposes RE-BPFT, an enhanced consensus algorit...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-07-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/15/13/7591 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849319959175364608 |
|---|---|
| author | Junwen Ding Xu Wu Jie Tian Yuanpeng Li |
| author_facet | Junwen Ding Xu Wu Jie Tian Yuanpeng Li |
| author_sort | Junwen Ding |
| collection | DOAJ |
| description | Practical Byzantine Fault Tolerance (PBFT) has been widely used in consortium blockchain systems; however, it suffers from performance degradation and susceptibility to Byzantine faults in complex environments. To overcome these limitations, this paper proposes RE-BPFT, an enhanced consensus algorithm that integrates a nuanced node credibility model considering direct interactions, indirect reputations, and historical behavior. Additionally, we adopt an optimized ID3 decision-tree method for node classification, dynamically identifying high-performing, trustworthy, ordinary, and malicious nodes based on real-time data. To address issues related to centralization risk in leader selection, we introduce a weighted random primary node election mechanism. We implemented a prototype of the RE-BPFT algorithm in Python and conducted extensive evaluations across diverse network scales and transaction scenarios. Experimental results indicate that RE-BPFT markedly reduces consensus latency and communication costs while achieving higher throughput and better scalability than classical PBFT, RBFT, and PPoR algorithms. Thus, RE-BPFT demonstrates significant advantages for large-scale and high-demand consortium blockchain use cases, particularly in areas like digital traceability and forensic data management. The insights gained from this study offer valuable improvements for ensuring node reliability, consensus performance, and overall system resilience. |
| format | Article |
| id | doaj-art-c4a29f7a0bc04b98b719bb178baa27b9 |
| institution | Kabale University |
| issn | 2076-3417 |
| language | English |
| publishDate | 2025-07-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj-art-c4a29f7a0bc04b98b719bb178baa27b92025-08-20T03:50:16ZengMDPI AGApplied Sciences2076-34172025-07-011513759110.3390/app15137591RE-BPFT: An Improved PBFT Consensus Algorithm for Consortium Blockchain Based on Node Credibility and ID3-Based ClassificationJunwen Ding0Xu Wu1Jie Tian2Yuanpeng Li3School of Computer and Electronic Information, Guangxi University, Nanning 530005, ChinaSchool of Information Science and Technology, Hainan Normal University, Haikou 571158, ChinaSchool of Computer and Electronic Information, Guangxi University, Nanning 530005, ChinaSchool of Computer and Electronic Information, Guangxi University, Nanning 530005, ChinaPractical Byzantine Fault Tolerance (PBFT) has been widely used in consortium blockchain systems; however, it suffers from performance degradation and susceptibility to Byzantine faults in complex environments. To overcome these limitations, this paper proposes RE-BPFT, an enhanced consensus algorithm that integrates a nuanced node credibility model considering direct interactions, indirect reputations, and historical behavior. Additionally, we adopt an optimized ID3 decision-tree method for node classification, dynamically identifying high-performing, trustworthy, ordinary, and malicious nodes based on real-time data. To address issues related to centralization risk in leader selection, we introduce a weighted random primary node election mechanism. We implemented a prototype of the RE-BPFT algorithm in Python and conducted extensive evaluations across diverse network scales and transaction scenarios. Experimental results indicate that RE-BPFT markedly reduces consensus latency and communication costs while achieving higher throughput and better scalability than classical PBFT, RBFT, and PPoR algorithms. Thus, RE-BPFT demonstrates significant advantages for large-scale and high-demand consortium blockchain use cases, particularly in areas like digital traceability and forensic data management. The insights gained from this study offer valuable improvements for ensuring node reliability, consensus performance, and overall system resilience.https://www.mdpi.com/2076-3417/15/13/7591PBFTconsensus algorithmnode credibilityID3 decision treeconsortium blockchain |
| spellingShingle | Junwen Ding Xu Wu Jie Tian Yuanpeng Li RE-BPFT: An Improved PBFT Consensus Algorithm for Consortium Blockchain Based on Node Credibility and ID3-Based Classification Applied Sciences PBFT consensus algorithm node credibility ID3 decision tree consortium blockchain |
| title | RE-BPFT: An Improved PBFT Consensus Algorithm for Consortium Blockchain Based on Node Credibility and ID3-Based Classification |
| title_full | RE-BPFT: An Improved PBFT Consensus Algorithm for Consortium Blockchain Based on Node Credibility and ID3-Based Classification |
| title_fullStr | RE-BPFT: An Improved PBFT Consensus Algorithm for Consortium Blockchain Based on Node Credibility and ID3-Based Classification |
| title_full_unstemmed | RE-BPFT: An Improved PBFT Consensus Algorithm for Consortium Blockchain Based on Node Credibility and ID3-Based Classification |
| title_short | RE-BPFT: An Improved PBFT Consensus Algorithm for Consortium Blockchain Based on Node Credibility and ID3-Based Classification |
| title_sort | re bpft an improved pbft consensus algorithm for consortium blockchain based on node credibility and id3 based classification |
| topic | PBFT consensus algorithm node credibility ID3 decision tree consortium blockchain |
| url | https://www.mdpi.com/2076-3417/15/13/7591 |
| work_keys_str_mv | AT junwending rebpftanimprovedpbftconsensusalgorithmforconsortiumblockchainbasedonnodecredibilityandid3basedclassification AT xuwu rebpftanimprovedpbftconsensusalgorithmforconsortiumblockchainbasedonnodecredibilityandid3basedclassification AT jietian rebpftanimprovedpbftconsensusalgorithmforconsortiumblockchainbasedonnodecredibilityandid3basedclassification AT yuanpengli rebpftanimprovedpbftconsensusalgorithmforconsortiumblockchainbasedonnodecredibilityandid3basedclassification |