Rational PBFT Consensus Algorithm with Evolutionary Game

Byzantine fault-tolerant algorithm is vital to ensure the distributed system such as blockchain reaching consistency.The performance of algorithm affects the security and stability of the system.In view of the low efficiency and lack of incentive mechanism of existing consensus algorithms, a rationa...

Full description

Saved in:
Bibliographic Details
Published inJi suan ji ke xue Vol. 49; no. 3; pp. 360 - 370
Main Authors Yang, Xin-yu, Peng, Chang-gen, Yang, Hui, Ding, Hong-fa
Format Journal Article
LanguageChinese
Published Chongqing Guojia Kexue Jishu Bu 01.03.2022
Editorial office of Computer Science
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Byzantine fault-tolerant algorithm is vital to ensure the distributed system such as blockchain reaching consistency.The performance of algorithm affects the security and stability of the system.In view of the low efficiency and lack of incentive mechanism of existing consensus algorithms, a rational practical Byzantine fault-tolerant consensus algorithm with evolutionary game is proposed.Firstly, the trustworthiness of nodes in the consensus process is determined by node trust evaluation, the reputation value is used as the basis for the consensus enthusiasm of rational nodes, consensus nodes are divided based on reputation value, and the consensus method of node network fragmentation is adopted to improve consensus efficiency; secondly, the evolutionary game model is established for the impact of link dynamics between nodes in the consensus process on the reputation value, and based on the existence of the reputation stabilization strategy, an incentive mechanism based on reputation value rewards is designe
ISSN:1002-137X
DOI:10.11896/jsjkx.210900110