计算机与数字工程2024，Vol.52Issue(1)：87-93,7.DOI:10.3969/j.issn.1672-9722.2024.01.013
GBFT:一种实用拜占庭容错算法改进方案
GBFT:An Improved Practical Byzantine Fault Tolerant Algorithm
摘要
Abstract
Blockchain technology has become a research hotspot in recent years.In the financial,logistics and other indus-tries,there have been landing cases of alliance blockchain.As the core technology of blockchain,consensus algorithm will have a direct impact on the overall performance of blockchain.The PBFT(practical byzantine fault tolerance)algorithm used in alliance chain still has the problems of long transaction confirmation time and low throughput.For alliance chain application scenario,based on PBFT algorithm,non-Byzantine fault-tolerant protocol is introduced.Combined with the election mechanism based on node be-havior,a three-level consensus mechanism PBFT,GBFT,is proposed.Finally,GBFT is compared with PBFT algorithm in terms of throughput,transaction confirmation delay and fault tolerance.The experimental results show that GBFT maintains 1/3 of the fault tolerance of PBFT,improves throughput and reduces transaction confirmation delay.关键词
区块链/共识算法/实用拜占庭容错Key words
blockchain/consensus algorithm/practical Byzantine fault tolerance分类
信息技术与安全科学引用本文复制引用
李彬,张新有..GBFT:一种实用拜占庭容错算法改进方案[J].计算机与数字工程,2024,52(1):87-93,7.基金项目
国家自然科学基金项目(编号:61802319)资助. （编号:61802319）
