基于Harary图生成树的部分重复码构造  

Fractional Repetition Codes Construction Based on Spanning Trees of Harary Graph

作　　者：张鑫楠 沈克勤 孙伟 何亚锦 ZHANG Xin-Nan;SHEN Ke-Qin;SUN Wei;HE Ya-Jin(School of Information Engineering,Chang’an University,Xi’an 710064,China)

机构地区：[1]长安大学信息工程学院,西安710061

出　　处：《计算机系统应用》2021年第4期241-246,共6页Computer Systems & Applications

摘　　要：针对部分重复码的有效修复问题,本文基于Harary图生成树构造出了一种新型的部分重复(Fractional Repetition based on Spanning trees of Harary graph,FRSH)码.实验结果表明,相较于现有的里所(Read-Solomon,RS)码和简单再生码(Simple Regeneration Codes,SRC),FRSH码在修复带宽开销、修复局部性等方面得到了更低的开销,且改善了修复效率,并将故障节点的修复时间缩短.Aiming at the low efficiency in repairing failed nodes of fractional repetition codes,this study proposed a construction algorithm of Fractional Repetition codes based on Spanning trees of Harary graph(FRSH).As a result,FRSH codes have lower computational overhead in repairing bandwidth overhead and locality than RS codes and SRC.Besides,FRSH codes are more efficient and spend less time in repairing failed nodes,compared with the other two codes.

关 键 词：部分重复码 HARARY图 生成树 离心率 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]