An Improved Practical Byzantine Fault-Tolerant Algorithm Based on XGBoost Grouping for Consortium Chains
In response to the challenges presented by the unreliable identity of the master node, high communication overhead, and limited network support size within the Practical Byzantine Fault-Tolerant (PBFT) algorithm for consortiu... | Find, read and cite all the research you need on Tech Science Press
Authors
- Haiyang Zhang (ORCID: https://orcid.org/0000-0002-1637-9137)
- Xiaowei Wang (ORCID: https://orcid.org/0000-0001-8920-2669)
- Zhengyi Li (ORCID: https://orcid.org/0000-0002-2808-8767)
- Jiasheng Zhang
- Kexin Cui
- Lihua Wang (ORCID: https://orcid.org/0009-0002-0140-4085)
- Z. Peng
- Yingkai Ge
Publication Details
- Journal
- Computers, materials & continua/Computers, materials & continua (Print)
- Published
- 2024-11-21
- DOI
- https://doi.org/10.32604/cmc.2024.058559
- Citations
- 1
- Primary Topic
- Distributed and Parallel Computing Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.35