Efficient Byzantine fault tolerant algorithm DIG-PBFT based on reward point mechanism
Practical Byzantine Fault Tolerance Consensus Algorithm(PBFT),as the most common consensus algorithm in alliance chains,can ensure the correctness of the system when there are less than one third of the malicious nodes.However,the PBFT algorithm has problems such as high latency,low throughput,security of master node selection,and unprocessed malicious nodes in the process of establishing trust and consensus.In order to solve these problems,a reward point mechanism is introduced to group consensus nodes and sets a candidate node set,and proposes an efficient and fast Byzantine fault tolerant algorithm(DIG-PBFT).During the consensus process,DIG-PBFT increases the participation of nodes with higher security by dynamically adjusting the nodes that actually participate in the consensus.The simulation experiment results show that compared with the PBFT algorithm and its similar work,the DIG-PBFT algorithm has greater throughput,lower latency,and higher security.
万方数据
维普
