针对最小带宽再生情形下的有效修复问题,提出了一种新型部分重复(FR,fractional repetition)码设计。该设计由外部最大距离可分(MDS,maximum distance separable)码和内部重复码组成,称为GDDBFR(group divisible design based FR)码,可以达到随机访问模式下的系统存储容量,并且能够在很大范围内选择构造参数。理论分析指出,尽管GDDBFR码采用基于表格的修复方式,但通常具有大量的节点修复选择方案。此外,实验结果表明,与传统的RS(Reed-Solomon)码和再生码相比,GDDBFR码可以显著地减少失效修复时间。
A novel design of FR(fractional repetition) codes was proposed which aims at providing efficient repair at the minimum bandwidth regenerating point. The design consisted of an outer MDS(maximum distance separable) code and an inner repetition code, called GDDBFR(group divisible design based FR) codes. The proposed codes can achieve the system storage capacity under the random access model and are available for a wide range of parameters. Despite of the table-based repair, theoretical analysis identifies that GDDBFR codes generally have large node repair alternatives. Furthermore, experimental results show that GDDBFR codes can significantly reduce the failure repair time when compared with legacy RS(Reed-Solomon) codes and regenerating codes in the domain.