Linear Exact-Repair Construction of Hybrid MSR Codes in Distributed Storage Systems

An [n, k, d]-hybrid minimum storage regenerating (HMSR) codes is one class of minimum storage regenerating (MSR) codes where each storage node stores two symbols in a distributed storage system (DSS). Due to the ability of reducing repair bandwidth and minimizing disk I/O cost, HMSR codes are proper to be used in practice. In this letter, we prove that there exists no linear exact-repair HMSR codes when k ≥ 5. A construction of [6,3,4]-HMSR codes is devised in F2. Focused on [4,2,3]-HMSR codes, a repair-by-transfer construction and the corresponding regenerating algorithm are proposed.

[1]  Kannan Ramchandran,et al.  Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions , 2010, IEEE Transactions on Information Theory.

[2]  Kannan Ramchandran,et al.  Explicit construction of optimal exact regenerating codes for distributed storage , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[3]  Yunghsiang Sam Han,et al.  Exact regenerating codes for Byzantine fault tolerance in distributed storage , 2012, 2012 Proceedings IEEE INFOCOM.

[4]  Kannan Ramchandran,et al.  Exact Regenerating Codes for Distributed Storage , 2009, ArXiv.

[5]  Kannan Ramchandran,et al.  Explicit codes minimizing repair bandwidth for distributed storage , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[6]  Yunnan Wu,et al.  A Construction of Systematic MDS Codes With Minimum Repair Bandwidth , 2009, IEEE Transactions on Information Theory.

[7]  Ming Xiao,et al.  Exact optimized-cost repair in multi-hop distributed storage networks , 2014, 2014 IEEE International Conference on Communications (ICC).

[8]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.