Improved Consensus Algorithm RBFT for PBFT Based on Raft Voting Mechanism
BAI Shangwang
LI Yi
GAO Gaimei
LIU Chunxia
DANG Weichao
Abstract：PBFT algorithm has the problems of time extension,inefficiency and dynamism,this paper proposes a consensus algorithm RBFT(Raft Byzantine Fault Tolerant)based on Raft voting mechanism.Since the selection of master nodes in PBFT algo-rithm is too arbitrary and easy to re-elect malicious nodes,this algorithm layers the nodes into consensus domain and backup do-main,the selection of master nodes is changed to the voting election of Leader in Raft,and the election of alternative master nodes(Leader)in alternative domain R2 is conducted simultaneously in the process of consensus in consensus domain R1,which realizes the dynamic increase and decrease of nodes in backup domain,and at the same time,the view switching protocol in optimized.The communication consumption is reduced and the latency is further reduced.After experiments,it is concluded that the improved algo-rithm has further reduced the latency and improved the throughput compared with the original algorithm.
Keywords：Raft voting mechanismPBFTblockchainconsensus algorithm
Publication Date：2023-11-20
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：4( 2511-2514 )