一种面向供应链溯源应用的改进PBFT算法

An Improved PBFT Algorithm for Supply Chain Traceability

针对供应链溯源存在数据造假、运力不透明等问题,将区块链技术的去中心化、数据不可篡改等特性与供应链溯源结合,提出一种改进的动态实用拜占庭容错算法(practical Byzantine fault tolerance,PBFT)。引入计分机制选取主节点,以保证网络能够识别并标记出分值较高的节点;根据区块链基础结构将供应链溯源模型架构设计为数据层、合约层、应用层3层,合约层中使用改进的动态实用拜占庭容错算法动态更新主节点,减少主节点为拜占庭节点的概率,降低网络中交易延迟;以通讯开销、交易延迟作为衡量指标,对改进算法的有效性进行实验验证。结果表明,与实用拜占庭容错算法相比,随着节点数目逐渐增多,改进算法可明显降低通讯开销与交易延迟。

In order to solve the problems of data falsification and opaque transportation method in supply chain traceability,combined the characteristics of block chain technology,such as decentralization and data tampering,with supply chain traceability,an improved dynamic practical Byzantine fault tolerance(PBFT)algorithm was proposed.The scoring mechanism was introduced to select the master node to ensure that the network can identify and mark the node with higher score.According to the blockchain infrastructure,the supply chain traceability model architecture was designed as three layers:data layer,contract layer and application layer.In the contract layer the improved dynamic PBFT algorithm was used to update dynamically master node,and the probability that the master node is Byzantine node,and the transaction delay in the network was reduced.The communication cost and transaction delay were used as the measurement indexes to verify the effectiveness of the improved algorithm.The results show that compared with the PBFT algorithm,with the increasing number of nodes,the improved algorithm can significantly reduce the communication cost and transaction delay.