计算机应用与软件2025，Vol.42Issue(5)：282-290,9.DOI:10.3969/j.issn.1000-386x.2025.05.038
T_Raft:基于信任值的高性能拜占庭容错共识算法
T_RAFT:HIGH PERFORMANCE BYZANTINE FAULT TOLERANCE CONSENSUS ALGORITHM BASED ON TRUST VALUE
摘要
Abstract
Raft consensus algorithm is a log replication consistency algorithm.Aimed at the problems of split voting and excessive load of leader nodes in Raft algorithm,a high-performance Byzantine fault-tolerant consensus algorithm based on trust value,T_Raft consensus algorithm is proposed.Based on the idea of multi-node sharing,a parallel log replication method was proposed to increase data throughput.A node trust model was proposed to improve the voting election mechanism and log replication process,effectively detecting Byzantine nodes and enhancing the security of the algorithm.Experimental results show that,compared with the Raft consensus algorithm,the T_Raft consensus algorithm can ensure high efficiency while having Byzantine fault tolerance,and it also greatly improves the speed of elections.关键词
Raft/投票分裂/强领导者/T_Raft/拜占庭容错/信任度模型Key words
Raft/Voting split/Strong leader/T_Raft/Byzantine fault tolerance/Trust model分类
计算机与自动化引用本文复制引用
钱慧,郑朝晖..T_Raft:基于信任值的高性能拜占庭容错共识算法[J].计算机应用与软件,2025,42(5):282-290,9.基金项目
江苏高校自然科学研究项目(19KJA550002). （19KJA550002）
