基于投票机制的拜占庭容错共识算法

针对现有的区块链中实用拜占庭容错(PBFT)共识算法、基于动态授权的拜占庭容错(DDBFT)共识算法、联盟拜占庭容错(CBFT)共识算法普遍存在能耗高、效率低、扩展性差等问题,通过引入投票机制,提出了基于投票机制的拜占庭容错(VPBFT)共识算法。首先,以PBFT算法为基础,将网络中的节点划分为四类具有不同职责的节点。其次,算法中的投票节点具有投票和评分权,监督生产节点诚实可靠地生产数据块;生产有效的数据块的生产节点优先进入下一轮,候选节点能够被选为生产节点,而普通节点则能够成为投票节点或候选节点。最后,不同类型的节点之间具有一定的数量关系,能够在不同类型节点的数目或网络中的节点总数发生变化时动态调整参数,从而使得算法适应动态网络。通过性能仿真分析可知,VPBFT算法相较于PBFT、 DDBFT、CBFT等共识算法,具有低能耗、低时延、高容错性和高动态性。

Byzantine fault tolerance consensus algorithm based on voting mechanism

Focusing on the problems of high energy consumption, low efficiency and poor scalability of Practical Byzantine Fault Tolerance (PBFT) consensus algorithm, Dynamic authorized Byzantine Fault Tolerance (DDBFT) consensus algorithm and Consortium Byzantine Fault Tolerance (CBFT) consensus algorithm existed in the blockchain, Practical Byzantine Fault Tolerant consensus algorithm based on Voting (VPBFT) was proposed by introducing voting mechanism. Firstly, based on PBFT algorithm, the nodes in the network were divided into four types of nodes with different responsibility. Secondly, the voting nodes in the algorithm had voting and scoring rights to supervise the production nodes to produce data blocks honestly and reliably, the production nodes producing valid data blocks had priority to be selected into next turn, while the candidate nodes were able to be voted as production nodes, and the ordinary nodes were able to be voted as production nodes or candidate nodes. Finally, different types of nodes had a certain quantity relationship between themselves, which means the parameters were able to be dynamically adjusted when the number of different types of nodes or the total number of nodes in the network changed, so that the algorithm was able to adapt to the dynamic network. Through performance simulation analysis, the proposed VPBFT algorithm has low energy consumption, short delay, high fault tolerance and high dynamicity compared with consensus algorithms such as PBFT, DDBFT and CBFT.