A Low-Complexity Shorten Regenerating Code with Optimal Repair Bandwidth
Regenerating codes (RGCs) are considered as optimal trade-off between repair bandwidth and storage amount per node in a distributed storage system (DSS). Actually, due to the limited nodes’ amount and bandwidth resources in networks, redundant bandwidth cost and assisted nodes connections will involve as employing the traditional RGC. Specific to these problems, we propose a new code, named shorten minimum storage regenerating code (sMSR) with two novel targets, unit storage cost (USC) and unit repair bandwidth (URB), and construct it by removing some information bits of the mother code generated by product matrix in encoding process. Additionally, in order to improve the availability of sMSR, we implement Binary Addition and Shift Implementable Convolution (BASIC) to decrease the computation complexity. The simulation results demonstrate that our code improves repair efficiency of MSR codes in practical DSS.
KeywordsDistributed storage system Shorten codes Regenerating codes BASIC Repair bandwidth
This work was supported by the National Natural Sciences Foundation of China under Grant 61701136, Grant 61771158, Grant 61501140, and Grant 61525103, and Project funded by China Postdoctoral Science Foundation 2018M630357, and Shenzhen Basic Research Program under Grant JCYJ2017081114233370, Grant JCYJ20170811154309920 and Grant ZDSYS20170728090330586.
- 1.Ma Y, Nandagopal T, Puttaswamy KPN, Banerjee S. An ensemble of replication and erasure codes for cloud file systems. In: Proceedings IEEE. INFOCOM; 2013. p. 1276–84.Google Scholar
- 4.Oggier F, Datta A. Self-repairing homomorphic codes for distributed storage systems. In: Proceedings IEEE. INFOCOM; 2011. p. 1215–23.Google Scholar
- 5.Oggier F, Datta A. Self-repairing codes for distributed storage a projective geometric construction. In: Information theory workshop; 2011. p. 30–4.Google Scholar