EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

RF-PBFT is an Improved PBFT Consensus Algorithm Based on the Random Forest Algorithm

Yingchen Xu, Ye Tian, Ying Jing, Fujiang Yuan

Journal of Computer Science and Digital Technology · 13.03.2026 · 2 (1) · 21-26

DOI: 10.71204/pyppdf95 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computer Science and Digital Technology, online erschienen am 13.03.2026. Verfasst von Yingchen Xu und 3 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The Practical Byzantine Fault-Tolerant (PBFT) consensus algorithm faces challenges such as random master node selection, high communication overhead, and a lack of incentive and penalty mechanisms, which undermine its efficiency and security in large-scale network environments. To address these issues, this paper proposes an improved PBFT consensus algorithm, RF-PBFT, which integrates a random forest-based node grouping mechanism with a dynamic reputation system. The algorithm leverages key behavioral data of nodes during the consensus process to train a random forest model, partitioning nodes into a consensus set and a candidate set. Nodes with superior predictive performance are selected to participate in the consensus process, thereby reducing redundant communication overhead. Furthermore, a differentiated reputation mechanism is established for the consensus group and the candidate group to encourage positive behavior and deter malicious actions. The master node is elected through a combination of prediction results and voting, enhancing system reliability and security. Simulation results demonstrate that, compared with traditional PBFT and other state-of-the-art variants, RF-PBFT significantly reduces communication overhead, decreases consensus latency, and improves throughput, validating its effectiveness in multi-node blockchain systems.

Zitieren

APA

Xu, Y., Tian, Y., Jing, Y., & Yuan, F. (2026). RF-PBFT is an Improved PBFT Consensus Algorithm Based on the Random Forest Algorithm. Journal of Computer Science and Digital Technology, 2(1), 21-26. https://doi.org/10.71204/pyppdf95

Vancouver

Xu Y, Tian Y, Jing Y, Yuan F. RF-PBFT is an Improved PBFT Consensus Algorithm Based on the Random Forest Algorithm. Journal of Computer Science and Digital Technology. 2026;2(1):21-26. doi:10.71204/pyppdf95

BibTeX
@article{Xu2026,
  author = {Xu, Yingchen and Tian, Ye and Jing, Ying and Yuan, Fujiang},
  title = {RF-PBFT is an Improved PBFT Consensus Algorithm Based on the Random Forest Algorithm},
  journal = {Journal of Computer Science and Digital Technology},
  year = {2026},
  volume = {2},
  number = {1},
  pages = {21--26},
  doi = {10.71204/pyppdf95}
}
Kostenlos starten →