基于矩阵变换和可调节环的部分重复码构造

目前在构造部分重复码(Fractional Repetition Codes, FRC)的研究方法中发现, 大多数是基于同构的分布式存储系统, 但实际的存储系统往往需要满足异构的特性. 为此, 本文提出了两种构造异构FRC的方法, 一种是基于矩阵变换构造的异构FRC, 该方法用于构造重复度为2, 节点存储容量异构的FRC, 相比用正则图构造的同构FRC, 具有算法计算复杂度低, 更符合现实存储系统的优点; 另外, 本文还提出了运用可调节环构造FRC的方法, 用于构造重复度为2或3的FRC, 即可得到节点存储容量同构的FRC也可得到异构的FRC. 与现有的FRC对比分析, 发现本文构造的FRC在节点存储容量上具有异构的特点, 修复局部性好, 同时构造算法运算复杂度低, 可以大范围的选择参数, 构造结构简单直观.

Construction of Fractional Repetition Codes Based on Matrix Transformation and Adjustable Ring

According to the current method of constructing Fractional Repetition Codes (FRC), it is found that most of them are distributed storage systems based on isomorphism, but the actual storage systems often need to satisfy the characteristics of heterogeneity. To this end, this study proposes two methods for constructing heterogeneous FRC. One is a heterogeneous FRC constructed based on matrix transformation. This method is used to construct an FRC with a repeatability of 2 and a heterogeneous storage capacity of nodes. Compared with the existing isomorphic FRC constructed by regular graphs, it has the advantages of lower computational complexity and more in line with the real storage system. In addition, this study also proposes a method of constructing FRC using adjustable rings, which FRC is constructed with a repeatability of 2 or 3, which can obtain the FRC of the node storage capacity is isomorphic, and can also get the heterogeneous FRC. Compared with the existing FRC, it is found that the FRC constructed in this study has heterogeneous characteristics in node storage capacity, good repair locality, and low computational complexity of the construction algorithm. It can select parameters in a wide range and the construction structure is simple and intuitive.