Open AccessResearch on Practical Byzantine Fault Tolerant Algorithm Based on Trust Mechanism
Author(s) -
Hui Pang Hui Pang,
Yanan Liu Hui Pang,
Xiumei Wen Yanan Liu,
Yingxue Mu Xiumei Wen
Publication year - 2022
Publication title -
diànnǎo xuékān/diannao xuekan
Language(s) - English
Resource type - Journals
eISSN - 2312-993X
pISSN - 1991-1599
DOI - 10.53106/199115992022043302002
Subject(s) - byzantine fault tolerance , computer science , algorithm , quantum byzantine agreement , fault tolerance , overhead (engineering) , distributed computing , node (physics) , network packet , blockchain , computer network , computer security , engineering , structural engineering , operating system
The consensus algorithm is one of the core technologies of the blockchain, which determines how the nodes in the blockchain network reach a consensus and enable them to jointly maintain a piece of data. This paper focuses on the Practical Byzantine Fault Tolerant Algorithm (PBFT Algorithm), and proposes a Practical Byzantine Fault Tolerant Algorithm based on Trust Mechanism (TM-PBFT Algorithm) to solve the problems of its low fault-tolerant rate and high communication cost. This algorithm supports voting for trusted nodes before the consensus cycle starts. In order to make nodes actively vote and vote for reliable nodes, this paper models the trust degree of nodes. In addition, the time factor is added to the Shapley value to design a new reward and punishment scheme, which makes the distribution of income of each node more reasonable and further encourages nodes to vote for reliable nodes. As the system runs for a long time, the probability of malicious nodes becoming master nodes decreases. Finally, a comparison experiment between the proposed algorithm and the PBFT algorithm shows that the fault tolerance and throughput of the TM-PBFT algorithm are higher than that of the PBFT algorithm, and the communication bandwidth overhead is lower than that of the PBFT algorithm.