基于信用模型的实用拜占庭容错共识算法  

Practical Byzantine Fault-tolerant Consensus Algorithm Based on Credit Model

作　　者：周新祥 郑广海[1] ZHOU Xinxiang;ZHENG Guanghai(Dalian Jiaotong University,Dalian 116028,China)

机构地区：[1]大连交通大学,辽宁大连116028

出　　处：《数字通信世界》2023年第2期9-11,17,共4页Digital Communication World

摘　　要：针对实用拜占庭容错(PBFT)算法主节点选取随机、存在频繁视图切换的问题,文章提出基于信用模型的拜占庭容错共识机制。根据节点行为奖惩信用值,划分节点等级,按照等级选取主节点,引入信用值回收机制,避免节点信用值过高产生马太效应。通过对比仿真实验分析,改进后的算法能够减少视图切换概率,降低时延,提高共识效率。Aiming at the problem that the master node of the practical byzantine fault tolerant algorithm(PBFT)is selected randomly and there is frequent view switching,a Byzantine fault tolerant consensus mechanism based on credit model is proposed.According to the node behavior,reward and punish the credit value,divide the node level,select the main node according to the level,and introduce the credit value recovery mechanism to avoid the Matthew effect caused by excessive node credit value.Through comparative simulation analysis,the improved algorithm can reduce the view switching probability,reduce the delay,and improve the consensus efficiency.

关 键 词：实用拜占庭容错 信用模型 共识机制 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]