基于Petersen图的部分重复码OACSTPCD
Fractional Repetition Codes Based on Petersen Graphs
为对分布式存储系统的修复效率研究,提出一种基于Petersen图边染色的部分重复码设计.该设计利用Petersen图边染色进行构造,即先对Petersen图的边进行染色,标记出染色的不同边数,然后构造Petersen图中不同边色的链路,最后把每条链路视为部分重复码的存储节点,称为 PECBFR码.理论分析指出,PECBFR码可以随机访问模式下的系统存储容量.此外,实验仿真结果显示,本文提出的基于Petersen图边染色的部分重复码构造算法,与分布式存储系统中的里所码以及简单再生码相比,在系统修复故障节点时,能够快速地修复故障节点,通过染色链路构造的部分重复码,在修复局部性、修复复杂度、修复带宽开销相较于分布式存储系统中的常见编码算法都有较大的性能提升.
In order to study the repair efficiency of distributed storage system,a fractional repetition code design based on Pe-tersen graph edge coloring is proposed.The design uses the edge coloring of Petersen graph to construct,that is,the coloring the edges of Petersen graph is dyed first,the different number of colored edges is marked,and then the links of different edge colors in Petersen graph is constructed.Finally,each link is regarded as a storage node of partial repeat code,which is called PECBFR code.Theoretical analysis points out that the PECBFR code can randomy access the system storage capacity in reach.In addi-tion,the experimental simulation results show that the proposed fractional repeat code construction algorithm based on Petersen graph edge coloring,compared with the reed-solomon codes and simple regenerative codes in distributed storage system,can quickly repair the faulty node when the system repairs the faulty node.Compared with common coding algorithms in distributed storage systems,the performance of repair locality,repair complexity and repair bandwidth overhead are greatly improved.
余春雷;刘笃晋;朱华伟;杨佳蓉
四川文理学院智能制造学院,四川 达州 635002||政务数据安全达州市重点实验室,四川 达州 635002四川文理学院智能制造学院,四川 达州 635002长安大学信息工程学院,陕西 西安 710064
计算机与自动化
分布式存储Petersen图边染色部分重复码修复
distributed storagePetersen graphedge coloringfractional repetition coderepair
《计算机与现代化》 2024 (003)
122-126 / 5
国家自然科学基金资助项目(62001059);陕西省重点研发计划项目(2021GY-019);政务数据安全达州市重点实验室项目(ZSAQ2209)
评论