期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Workload-based randomization byzantine fault tolerance consensus protocol 被引量:2
1
作者 Baohua Huang Li Peng +1 位作者 Weihong Zhao Ningjiang Chen 《High-Confidence Computing》 2022年第3期24-30,共7页
This paper introduces a new Byzantine fault tolerance protocol called workload-based randomization Byzantine fault tolerance protocol(WRBFT).Improvements are made to the Practical Byzantine Fault Tolerance(PBFT),which... This paper introduces a new Byzantine fault tolerance protocol called workload-based randomization Byzantine fault tolerance protocol(WRBFT).Improvements are made to the Practical Byzantine Fault Tolerance(PBFT),which has an important position in the Byzantine Fault consensus algorithm.Although PBFT has numerous ad-vantages,its primary node selection mechanism is overly fixed,the communication overhead of the consensus process is also high,and nodes cannot join and exit dynamically.To solve these problems,the WRBFT proposed in this paper combines node consensus workload and verifiable random function(VRF)to randomly select the more reliable primary node that dominates the consensus.The selection of the nodes involved in the consensus is based on the node workload,and the optimization of the agreement protocol of the PBFT is also based on this.Simulation results show that the WRBFT has higher throughput,lower consensus latency,and higher algorithmic efficiency compared to the PBFT. 展开更多
关键词 Blockchain Consensus algorithm BFT PBFT verifiable random function
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部