基于可信列表的改进拜占庭容错算法  

IMPROVED BYZANTINE FAULT TOLERANCE ALGORITHM BASED ON TRUSTED LISTS

作　　者：乔康 汤红波[1] 游伟[1] 王领伟[1] Qiao Kang;Tang Hongbo;You Wei;Wang Lingwei(Information Engineering University,Zhengzhou 450053,Henan,China)

机构地区：[1]解放军战略支援部队信息工程大学,河南郑州450053

出　　处：《计算机应用与软件》2022年第2期274-280,306,共8页Computer Applications and Software

基　　金：国家重点研发计划网络空间安全专项(2016YFB0801605);国家自然科学基金创新群体项目(61521003);国家自然科学基金项目(61801515)。

摘　　要：为减少实用拜占庭容错(PBFT)算法的通信开销,现有研究主要通过选举方式在保证安全的前提下挑选少量节点参与共识,但其灵活性差、容错率低、资源耗费高。对此,通过建立信用节点列表和信用评价机制,提出一种基于可信列表的改进拜占庭容错算法(CPBFT)。仿真分析表明,较PBFT算法,CPBFT算法不仅能提高节点灵活性和容错率,还降低了约42.74%的通信带宽开销,提升了约3.12%的交易吞吐量,降低了约3.03%的时延,具有一定性能优势。In order to reduce the communication overhead of the practical Byzantine fault tolerance(PBFT)algorithm,the existing research mainly uses election methods to select a small number of nodes to participate in the consensus under the premise of ensuring security.However,the existing algorithms still have the disadvantages of poor flexibility,low fault tolerance,and high resource consumption.To this end,this paper proposes an improved Byzantine fault tolerance algorithm(CPBFT)based on trusted lists by establishing credit node lists and credit evaluation mechanisms.Simulation analysis shows that compared with the PBFT algorithm,the CPBFT algorithm can not only improve node flexibility and fault tolerance,but also reduce communication bandwidth overhead by about 42.74%,increase transaction throughput by about 3.12%,and reduce delay by about 3.03%,which has certain performance advantages.

关 键 词：区块链 拜占庭算法 可信列表 信用评价 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]