基于对应比较图的Fabric排序机制优化  

Fabric Sorting Mechanism Optimization Based on Corresponding Comparison Graph

作　　者：刘润德 陈志德[1,2] LIU Run-De;CHEN Zhi-De(College of Computer and Cyber Security,Fujian Normal University,Fuzhou 350117,China;Fujian Provincial Key Lab of Network Security and Cryptology,Fujian Normal University,Fuzhou 350007,China)

机构地区：[1]福建师范大学计算机与网络空间安全学院,福州350117 [2]福建师范大学福建省网络安全与密码技术重点实验室,福州350007

出　　处：《计算机系统应用》2023年第5期323-329,共7页Computer Systems & Applications

基　　金：国家自然科学基金(62277010,61841701);福建省自然科学基金(2020J01171,2021J011013)。

摘　　要：针对HLF(Hyperledger Fabric)区块链系统在排序阶段中存在的缺陷,提出了一种基于对应比较图的图排序优化方案.利用对应比较图具有相关不变性质的图合并过程以及其算法运行时间短的特点,设计了一种基于交易重要度的拓扑算法,旨在减少由于默认的顺序排序而导致的序列化冲突问题.通过实验与分析,表明该方案有效解决了原始方案的序列化冲突问题,减少了系统中无效事务的比例,提升了系统交易效率,节省了大量的计算与存储资源.In view of the defects of Hyperledger Fabric in the sorting stage,an optimization scheme of graph sorting based on the corresponding comparison graph is proposed.As the corresponding comparison has a graph merging process with correlation invariance and a short algorithm running time,a topological algorithm based on transaction importance is designed to reduce the serialization conflict caused by the default sequence sorting.The experiments and analysis show that this scheme effectively solves the serialization conflict problem of the original scheme,reduces the proportion of invalid transactions in the system,improves the transaction efficiency of the system,and saves a lot of computing and storage resources.

关 键 词：Hyperledger Fabric 对应比较图 交易重要度 拓扑排序 

分 类 号：O223[理学—运筹学与控制论] TP311.13[理学—数学]