Research Article
R2-PBFT: An Improved PBFT Consensus Algorithm Based on Hash Ring and Reputation Model
@INPROCEEDINGS{10.4108/eai.8-9-2023.2340194, author={LeLing Zhou and Kunfeng Wang and JianYing Chen}, title={R2-PBFT: An Improved PBFT Consensus Algorithm Based on Hash Ring and Reputation Model}, proceedings={Proceedings of the 4th International Conference on Modern Education and Information Management, ICMEIM 2023, September 8--10, 2023, Wuhan, China}, publisher={EAI}, proceedings_a={ICMEIM}, year={2023}, month={11}, keywords={blockchain; consensus algorithm; pbft; reputation model}, doi={10.4108/eai.8-9-2023.2340194} }- LeLing Zhou
Kunfeng Wang
JianYing Chen
Year: 2023
R2-PBFT: An Improved PBFT Consensus Algorithm Based on Hash Ring and Reputation Model
ICMEIM
EAI
DOI: 10.4108/eai.8-9-2023.2340194
Abstract
To address the issue of poor stability in consensus networks caused by arbitrary selection of main nodes in the PBFT consensus algorithm, this paper proposes a improved algorithm named R2-PBFT, which means Random and Reliable PBFT and is improved from PBFT algorithm based on hash ring and reputation model. Firstly, a dynamic reputation evaluation model was constructed to classify nodes with good reputation values into main node group. Then, the nodes within the main node group are hashed and formed a logical hash ring. Meanwhile, when a transaction is comping, it is mapped to the hash ring in the same way. Finally, the first node in the clockwise direction at the hash ring is selected as the main node. Theoretical analysis and experiments have shown that, our algorithm effectively avoids problems such as predicted attacks on the main node and power concentration, and effectively improves the reliability and stability of consensus networks.
