提升区块链多轮PBFT验证效率的节点分配方案

NODE ALLOCATION SCHEME FOR IMPROVING THE EFFICIENCY OF MULTIPLE ROUNDS OF PBFT VERIFICATION IN BLOCKCHAIN

  • 摘要: 为解决区块链分片技术导致的单个分片失效的问题,多轮PBFT(Practical Byzantine Fault Tolerance protocol)验证方案被提出,但其节点随机分配过程会导致交易验证有效性降低,通过对这一问题进行分析,同时对目前主要分片项目的节点分配方案进行研究比较,提出一种基于节点评价的节点分配方案。该方案通过对区块链系统内节点进行评分,可对疑似拜占庭节点进行标记,并根据身份标记实现加入和退出分片的操作,实现了分片内拜占庭节点比例的明显降低,提高了验证效率。通过四组对比实验,说明基于节点评价的节点分配方案有更高的验证效率,明显提升了系统吞吐量。

     

    Abstract: In order to solve the problem of single shard failure caused by sharding technology in blockchain, a multi-round PBFT verification scheme is proposed. However, the random allocation process of nodes will reduce the effectiveness of transaction verification. By analyzing this problem and comparing the current node allocation schemes of major sharding projects, a node allocation scheme based on node evaluation is proposed. This scheme marked suspected Byzantine nodes by scoring the nodes in the blockchain system, and realized the operation of joining and exiting the shard according to the identity mark, which realized a significant reduction in the proportion of Byzantine nodes in the shard and improved the verification efficiency. Through four sets of comparative experiments, it shows that the node allocation scheme based on node evaluation has higher verification efficiency and significantly improves system throughput.

     

/

返回文章
返回