文献类型：期刊文献

中文题名：S-Raft:一种增强拜占庭和崩溃容错的Raft算法

英文题名：S-Raft:enhanced Byzantine and crash tolerance Raft algorithm

作者：王壮[1,2];徐成[1,2];代松银[1,2];刘宏哲[1,2];李学伟[1]

第一作者：王壮

机构：[1]北京联合大学北京市信息服务工程重点实验室,北京100101;[2]北京联合大学机器人学院(人工智能学院),北京100101

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

年份：2025

卷号：42

期号：3

起止页码：687-692

中文期刊名：计算机应用研究

外文期刊名：Application Research of Computers

收录：;北大核心:【北大核心2023】；

基金：国家自然科学基金资助项目(62102033,62171042);北京市重点科技资助项目(KZ202211417048);北京市属高等学校高水平科研创新团队建设支持计划项目(BPHR20220121);北京市自然科学基金资助项目(4232026,4242020);北京联合大学学术研究项目(ZKZD202302,ZK20202403,ZK10202404)。

语种：中文

中文关键词：Raft;PBFT;共识算法;区块链;拜占庭

外文关键词：Raft;PBFT;consensus algorithm;blockchain;Byzantium

摘要：传统的Raft共识算法在私有链中因其简洁和崩溃容错而得到广泛应用,但无法解决拜占庭节点恶意行为导致的诸多问题。在深入分析现有研究成果的基础上,提出了一种基于Raft的增强拜占庭和崩溃容错的共识算法:S-Raft(Stability-Raft),以解决拜占庭节点在选举中伪造身份、投票分裂以及非法替换领导者等核心问题。引入故障心跳日志机制,通过广播故障信息阻止拜占庭节点获得多数选票;实施选举超时周期优化策略,以应对投票分裂问题;提出节点稳定性评估算法,结合连续性惩罚和时间衰减因子,准确评估节点稳定性,减少因频繁故障引发的通信冗余。实验结果显示,与Raft和PBFT等算法相比,S-Raft算法在拜占庭容错能力上取得了显著提升,同时保持了较高的吞吐量和较低的共识时延。因此,S-Raft算法具有良好的拜占庭和崩溃容错能力。
The traditional Raft consensus algorithm is widely used in private chains due to its simplicity and crash fault tole-rance,but it cannot solve the problems caused by malicious behavior from Byzantine nodes.Based on the in-depth analysis of existing research results,this paper proposed an enhanced Byzantine and crash fault-tolerant consensus algorithm based on Raft,called S-Raft(Stability-Raft),to solve the core problems such as forging identities,vote splitting,and illegal replacement of leaders in elections of Byzantine nodes.It introduced a faulty heartbeat log mechanism to prevent Byzantine nodes from obtaining majority votes by broadcasting fault information.It implemented an election timeout period optimization strategy to deal with vote splitting.It also proposed a node stability evaluation algorithm that combined continuity penalties and a time decay factor to accurately assess node stability and reduce communication redundancy caused by frequent failures.Experimental results show that,compared to Raft and PBFT,the S-Raft algorithm achieves significant improvements in Byzantine fault tole-rance while maintaining high throughput and low consensus latency.Therefore,S-Raft demonstrates strong Byzantine and crash fault tolerance.