应用于分布式存储系统的准循环再生码构造方案

发布时间：2018-06-05 01:52

本文选题：网络编码 + 分布式存储系统　；参考：《计算机工程》2015年03期

【摘要】：传统纠错码编码方案能够提高系统容错能力,但在数据修复时会占用大量带宽。为此,基于循环结构,构造一种面向分布式存储系统的准循环最小存储再生码。根据该准循环再生码的冗余系数向量权重和修复带宽边界,设计一种改进的节点修复算法,证明其修复带宽在最好情况能达到最小割下界,在最坏情况下也优于最大距离可分码的修复带宽。实验结果表明,该再码构造方案不仅节省存储空间,而且具有构造简单、运算代价低和修复带宽小等特点。
[Abstract]:The traditional error-correcting code coding scheme can improve the fault-tolerant ability of the system, but it will take up a lot of bandwidth in the data repair. Therefore, based on the cyclic structure, a quasi-cyclic minimum memory regenerative code for distributed storage system is constructed. According to the redundancy coefficient vector weight and the repair bandwidth boundary of the quasi-cyclic regenerative code, an improved node repair algorithm is designed. It is proved that the repair bandwidth can reach the minimum cut bound in the best case. In the worst case, the repair bandwidth is better than the maximum distance divisible code. Experimental results show that the proposed scheme not only saves storage space, but also has the advantages of simple construction, low computational cost and small repair bandwidth.
【作者单位】：复旦大学上海市智能信息处理重点实验室;
【基金】：上海市科委基础研究基金资助重点项目(12JC1401400)
【分类号】：TP333

【相似文献】