摘要
提出了一种面向农产品供应链信息管理场景的改进PBFT(practical byzantine fault tolerance)算法,即MFW-PBFT(multi-factor weighted PBFT)算法。该算法通过基于节点的活跃度、数据贡献度和历史行为等多因素权重,选出一部分节点作为“代理节点”参与共识过程,且对一致性协议进行优化,从而在一定程度上解决了传统PBFT算法的性能瓶颈问题。结果显示,MFW-PBFT算法相较于传统PBFT算法和2种流行的改进PBFT算法,在处理大规模网络和交易数据时表现出更高的效率和稳定性。
In agricultural supply chain information management systems,the widely employed consensus algorithm is Practical Byzantine Fault Tolerance(PBFT).However,when the network expands and transaction volume surges,PBFT encounters performance limitations.In intricate scenarios,PBFT is faced with efficiency and stability compromises due to communication delays among nodes and node failures.In response to these challenges,a refined PBFT algorithm tailored to the context of agricultural supply chain information management,known as Multi-Factor Weighted PBFT(MFW-PBFT),is introduced.This algorithm selects a subset of nodes as‘proxy nodes’to participate in the consensus process based on multiple factor weights,including node activity,data contribution,and historical behavior.It also optimizes the consensus protocol,somehow addressing the performance bottlenecks of the traditional PBFT algorithm.Our research results demonstrate compared to traditional PBFT and two prevalent enhanced PBFT algorithms,the MFW-PBFT algorithm exhibits improved efficiency and stability in handling extensive network architectures and transaction data volumes.
作者
黄英来
黄鹤林
谷训开
杨柳松
HUANG Yinglai;HUANG Helin;GU Xunkai;YANG Liusong(College of Computer and Control Engineering,Northeast Forestry University,Harbin 150040,China)
出处
《重庆理工大学学报（自然科学）》
CAS
北大核心
2024年第6期164-171,共8页
Journal of Chongqing University of Technology：Natural Science
基金
国家自然科学基金项目(61902059)
黑龙江省自然科学基金项目(LH2020C051)。
