计算机与数字工程2024，Vol.52Issue(1)：213-218,246,7.DOI:10.3969/j.issn.1672-9722.2024.01.035
基于PBFT算法的分片技术的研究
Research on Fragmentation Technology Based on PBFT Algorithm
王旭东 1符精晶 2王赟1
作者信息
- 1. 江苏大学计算机科学与通信工程学院 镇江 212013
- 2. 沙洲职业工学院电子信息工程系 张家港 215600
- 折叠
摘要
Abstract
As an integrated innovation in the field of distributed consensus,blockchain has attracted the attention of techni-cians and researchers.However,at present,blockchain still faces the problem of scalability,which needs to be solved urgently.Fragmentation technology is considered to be the most practical solution to solve the scalability of blockchain system so far.Howev-er,there are also some problems in fragmentation technology.When nodes are allocated to fragmentation,it is necessary to pay at-tention to that its court nodes will also be allocated to each partition.When practical Byzantine fault tolerance(PBFT)algorithm is used,the credibility of partition data may not be guaranteed.To solve the above problems,a dynamic practical Byzantine fault algo-rithm based on PBFT consensus algorithm is proposed,which is improved by dynamic weight and aggregate signature(DPBFT)and ensures the credibility of partitioned data by adding dynamic weights to nodes for random allocation and improving the consensus al-gorithm.Experiments show that the improved algorithm can effectively improve the system fault tolerance,transaction throughput and reduce transaction delay.关键词
区块链/扩展性/分片技术/动态权重/PBFTKey words
blockchain/scalability/fragmentation technology/dynamic weight/PBFT分类
信息技术与安全科学引用本文复制引用
王旭东,符精晶,王赟..基于PBFT算法的分片技术的研究[J].计算机与数字工程,2024,52(1):213-218,246,7.
