[1]王甜甜,王汗青,孟 洁,等.自适应可分解部分重复码的扩展构造[J].计算机技术与发展,2023,33(11):14-19.[doi:10. 3969 / j. issn. 1673-629X. 2023. 11. 003]
　WANG Tian-tian,WANG Han-qing,MENG Jie,et al.Extended Construction of Adaptive-and-resolvable Fractional Repetition Codes[J].,2023,33(11):14-19.[doi:10. 3969 / j. issn. 1673-629X. 2023. 11. 003]
点击复制

自适应可分解部分重复码的扩展构造()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
33
期数:
2023年11期
页码:
14-19
栏目:
分布与并行计算
出版日期:
2023-11-10

文章信息/Info

Title:
Extended Construction of Adaptive-and-resolvable Fractional Repetition Codes
文章编号:
1673-629X(2023)11-0014-06
作者:
王甜甜1 ; 王汗青1 ; 孟 洁1 ; 余春雷2 ; 王晓峰1
1. 海军航空大学 航空基础学院,山东 烟台 264000;
2. 四川文理学院 智能制造学院,四川 达州 635000
Author(s):
WANG Tian-tian1 ; WANG Han-qing1 ; MENG Jie1 ; YU Chun-lei2 ; WANG Xiao-feng1
1. Aviation Foundation College,Naval Aviation University,Yantai 264000,China;
2. School of Intelligent Manufacturing,Sichuan University of Arts and Science,Dazhou 635000,China
关键词:
部分重复码; 分布式存储系统; 超图; 自适应可分解; 扩展构造
Keywords:
fractional repetition codes; distributed storage systems; hypergraph; adaptive-and-resolvable; extended construction
分类号:
TP391. 9
DOI:
10. 3969 / j. issn. 1673-629X. 2023. 11. 003
摘要:
部分重复( Fractional Repetition,FR) 码能够实现精确无编码修复,修复复杂度低且修复带宽成本小。 在动态分布式存储系统中,要求 FR 码的节点存储开销和数据块重复度会随机动态变化。 为了使 FR 码更灵活地适应动态分布式存储系统,该文提出利用超图实现自适应可分解 FR 码的扩展构造方法。 具体地,建立超图中边和顶点与 FR 码中节点和数据块的对应关系,通过增加或删除超图中对应边和顶点,实现超图的扩展构造,进而得到存储系统规模和存储文件规模变化时自适应可分解 FR 码的扩展构造。 基于这种方法,能够扩展构造出给定参数范围内所有自适应可分解 FR 码,列举了存储节点数 20 以内的所有参数。 自适应可分解 FR 码与常见的简单再生码( Simple Regenerating Codes,SRC) 和 RS( Reed-Solomon)码相比,在修复局部性和修复带宽开销方面具有一定优势。
Abstract:
Fractional repetition ( FR) codes can achieve exact uncoded repair for failed nodes,with lower repair computational complexityand repair bandwidth overhead. In dynamic distributed storage system,node storage overhead and coded packets repetition degree of FRcodes will change randomly and dynamically. In order to make FR codes more flexible to adapt to dynamic distributed storage system,wepropose the extended construction method of adaptive - and - resolvable FR codes by hypergraph. Specifically, the correspondingrelationship between edges and vertices in hypergraph and nodes and data blocks in FR codes is established. By adding or deleting corresponding edges and vertices in hypergraph,the extended construction of hypergraph and adaptive-and -resolvable FR code are realizedwhen file size and scale of distributed storage system change. Based on the scheme,all adaptive-and-resolvable FR codes within givenparameter ranges can be constructed by extension, and all the parameter within 20 storage nodes are listed. Compared with Simple Regenerating Codes ( SRC) and Reed - Solomon ( RS) codes, the adaptive - and - resolvable FR codes have some advantages in repairlocality and repair bandwidth overhead.

相似文献/References:

[1]王瑞通[],李炜春[]. 大数据基础存储系统技术研究[J].计算机技术与发展,2017,27(08):66.
　WANG Rui-tong[],LI Wei-chun[]. Research on Technology of Basic Large Data Storage System[J].,2017,27(11):66.
[2]何亚锦,孙? ?伟,沈克勤,等.局部修复码的最优构造[J].计算机技术与发展,2021,31(04):112.[doi:10. 3969 / j. issn. 1673-629X. 2021. 04. 019]
　HE Ya-jin,SUN Wei,SHEN Ke-qin,et al.Optimal Construction of Locally Repairable Codes[J].,2021,31(11):112.[doi:10. 3969 / j. issn. 1673-629X. 2021. 04. 019]

更新日期/Last Update: 2023-11-10