河南理工大学学报（自然科学版）2025，Vol.44Issue(2)：145-153,9.DOI:10.16186/j.cnki.1673-9787.2023060005
抗拜占庭节点的Raft改进算法研究
Research on the Raft improved algorithm for anti-Byzantine nodes
摘要
Abstract
Objectives In order to solve the problem of malicious election and log tampering caused by Byz-antine nodes in original Raft algorithm,an AntiB-Raft(Anti-Byzantine Raft)algorithm was proposed to re-sist Byzantine nodes.Methods When the candidate requested to replace the Leader,the heartbeat monitor-ing threshold mechanism was used to determine whether the candidate can successfully obtain enough votes to become the new Leader,which was agreed that only when more than half of the nodes detected that the current Leader was really down,the candidate can obtain more than half of the votes and become the new Leader,so as to prevent the Byzantine node from maliciously pulling votes when current Leader was not down,which would result in the replacement of the normal Leader.In the log verification phase,iterative hashing algorithm was used to encrypt the logs and appropriate verification time was selected for log verifi-cation.It was agreed that log verification was performed once every K transactions or Leader changed to en-sure that the synchronized logs were correct.During log verification,if the log verification failed,the bi-nary rollback method was used to locate the faulty log position quickly and retransmit it,which greatly im-proved the work efficiency.Results To simulate the 100-node election process,the normal Leader was re-placed in Raft algorithm because the candidate obtained more than 50%of the votes,while neither RB-Raft nor the proposed algorithm exceeded 50%,thus avoiding malicious canvassing.On the anti-Byzantine,error logs were not identified in Raft algorithm,while the error log recognition rate of AntiB-Raft algorithm can reach 100%,meanwhile the consensus delay was 28%lower than the existing algorithm RB-Raft.Con-clusions The proposed algorithm AntiB-Raft had the capability of anti-Byzantine and reduced consensus de-lay compared with the existing algorithm RB-Raft and its efficiency was improved significantly.关键词
Raft/共识机制/拜占庭容错/迭代哈希/心跳门限Key words
Raft/consensus mechanism/Byzantine fault tolerance/iterative hash/heartbeat threshold分类
信息技术与安全科学引用本文复制引用
王小伟,李杰..抗拜占庭节点的Raft改进算法研究[J].河南理工大学学报（自然科学版）,2025,44(2):145-153,9.基金项目
国家自然科学基金资助项目(61972134) （61972134）
河南省科技攻关项目(212102310264,202102310323) （212102310264,202102310323）
