基于推荐信任模型改进拜占庭容错共识算法  

Improved Byzantine fault tolerant consensus algorithm based on recommendation trust model

作　　者：张猛 王宝成[1] Zhang Meng;Wang Baocheng(School of Information,North China University of Technology,Beijing 100043,China)

机构地区：[1]北方工业大学信息学院,北京100043

出　　处：《计算机应用研究》2023年第3期667-670,共4页Application Research of Computers

基　　金：北京市教育委员会科学研究计划资助项目(110052971921/021)。

摘　　要：针对拜占庭容错算法存在通信开销大、节点选取简单、对恶意节点缺乏惩罚机制的问题,提出了一种基于推荐信任模型的改进拜占庭容错共识算法。引入P2P网络下的推荐信任模型,根据节点在共识阶段的行为,计算各节点的全局信任值,使用节点选取机制,解决节点选取简单的问题。全局信任值高的节点进入共识组,恶意节点被踢出共识组不再参与共识,解决恶意节点缺乏惩罚机制的问题。实验表明,R-PBFT较PBFT具有更低的网络开销和更高的容错性。To address the problems of Byzantine fault-tolerant algorithm with high communication overhead, simple node selection, and lack of penalty mechanism for malicious nodes, this paper proposed an improved Byzantine fault-tolerant consensus algorithm based on the recommendation trust model. It introduced the recommended trust model under P2P networks to calculate the global trust value of each node based on the behavior of nodes in the consensus phase, and used the node selection mechanism is to solve the problem of simple node selection. The nodes with high global trust value entered the consensus group, and malicious nodes were kicked out of the consensus group and no longer participate in the consensus, solving the problem of lack of punishment mechanism for malicious nodes. Experiments show that the R-PBFT algorithm has lower network overhead and higher fault tolerance than the PBFT algorithm.

关 键 词：区块链 拜占庭容错算法 推荐信任模型 

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