文献类型：会议论文

英文题名：Re-Raft: An Improved Blockchain Consensus Algorithm with Enhanced Byzantine Resistance and Crash Tolerance

作者：Wang, Zhuang[1];Xu, Cheng[1];Dai, Songyin[1];Li, Xuewei[2]

通讯作者：Xu, C[1]

机构：[1]Beijing Union Univ, Beijing Key Lab Informat Serv Engn, Beijing 100101, Peoples R China;[2]Beijing Union Univ, Sch Artificial Intelligence, Sch Robot, Beijing 100101, Peoples R China

第一机构：北京联合大学北京市信息服务工程重点实验室

通讯机构：[1]corresponding author), Beijing Union Univ, Beijing Key Lab Informat Serv Engn, Beijing 100101, Peoples R China.|[11417103]北京联合大学北京市信息服务工程重点实验室;[11417]北京联合大学;

会议论文集：2nd International Conference on Computer Vision and Intelligent Technology

会议日期：NOV 24-27, 2024

会议地点：Huaibei, PEOPLES R CHINA

语种：英文

外文关键词：blockchain; raft; Byzantium; consensus algorithm

摘要：The traditional Raft consensus algorithm is widely used in private chains due to its crash-tolerant feature, but it cannot solve many problems caused by the malicious behaviour of Byzantine nodes. Based on an in-depth analysis of existing research results, this paper proposes a consensus algorithm based on the Raft algorithm with enhanced Byzantine resistance and crash tolerance: Re-Raft (Reliability-Raft), in order to solve the core problems of Byzantine nodes identity forgery and illegal replacement of leaders. A fault heartbeat logging mechanism is introduced to prevent Byzantine nodes from obtaining the majority of votes by broadcasting fault heartbeat logs; and a node reliability assessment algorithm is proposed to accurately assess the reliability of nodes by combining the continuity penalty weights and the time decay factor to reduce communication redundancy triggered by frequent node failures. The experimental results show that compared with the native Raft, the Re-Raft algorithm achieves a significant improvement in Byzantine fault-tolerance capability.