Concurrent regenerating codes

To reduce multiple-failure repair traffic in erasure coded storage systems, Patrick Lee et al. introduce concurrent framework-based minimal-storage regenerating codes (RGCs). The approach is simpler and more practical than the cooperative mechanism in non-fully distributed environment. This study unifies such class of codes as concurrent RGC and further studies the characteristics by analysing the cut-based information flow graph. The authors present a general storage–bandwidth tradeoff and give closed-form expressions for the points on the curve including the minimal-bandwidth point. They show that the concurrent RGC can be constructed by reforming the existing single-node RGC or multiple-node cooperative RGC. Moreover, a connection to strong-maximum distance separable is also analysed.

[1]  Sanaa Sharafeddine,et al.  Practical multiple node failure recovery in distributed storage systems , 2016, 2016 IEEE Symposium on Computers and Communication (ISCC).

[2]  Dan Feng,et al.  General Functional Regenerating Codes with Uncoded Repair for Distributed Storage System , 2015, 2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing.

[3]  Yinlong Xu,et al.  MFR: Multi-Loss Flexible Recovery in Distributed Storage Systems , 2010, 2010 IEEE International Conference on Communications.

[4]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[5]  Hyuk Lee,et al.  An Outer Bound on the Storage-Bandwidth Tradeoff of Exact-Repair Cooperative Regenerating Codes , 2017, IEEE Transactions on Information Theory.

[6]  Anne-Marie Kermarrec,et al.  Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes , 2011, 2011 International Symposium on Networking Coding.

[7]  Stefan Savage,et al.  Total Recall: System Support for Automated Availability Management , 2004, NSDI.

[8]  Yang Tang,et al.  NCCloud: applying network coding for the storage repair in a cloud-of-clouds , 2012, FAST.

[9]  Pei Li,et al.  Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding , 2010, IEEE Journal on Selected Areas in Communications.

[10]  Baochun Li,et al.  Cooperative repair with minimum-storage regenerating codes for distributed storage , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[11]  Kenneth W. Shum,et al.  Repairing multiple failures in the Suh-Ramchandran regenerating codes , 2013, 2013 IEEE International Symposium on Information Theory.

[12]  Yunnan Wu.  Existence and construction of capacity-achieving network codes for distributed storage , 2009, 2009 IEEE International Symposium on Information Theory.

[13]  Kenneth W. Shum,et al.  Cooperative Regenerating Codes , 2012, IEEE Transactions on Information Theory.

[14]  Simson L. Garfinkel,et al.  An Evaluation of Amazon's Grid Computing Services: EC2, S3, and SQS , 2007 .

[15]  Yunnan Wu,et al.  A Survey on Network Codes for Distributed Storage , 2010, Proceedings of the IEEE.

[16]  Arman Fazeli,et al.  Minimum Storage Regenerating Codes for All Parameters , 2017, IEEE Transactions on Information Theory.

[17]  Zhifang Zhang,et al.  Exact cooperative regenerating codes with minimum-repair-bandwidth for distributed storage , 2013, 2013 Proceedings IEEE INFOCOM.

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

[19]  黄震,et al.  Repairing Multiple Data Losses by Parallel Max-min Trees Based on Regenerating Codes in Distributed Storage Systems , 2014 .

[20]  Patrick P. C. Lee,et al.  NCFS: On the Practicality and Extensibility of a Network-Coding-Based Distributed File System , 2011, 2011 International Symposium on Networking Coding.

[21]  Kannan Ramchandran,et al.  Exact-Repair MDS Code Construction Using Interference Alignment , 2011, IEEE Transactions on Information Theory.

[22]  Kenneth W. Shum.  Cooperative Regenerating Codes for Distributed Storage Systems , 2011, 2011 IEEE International Conference on Communications (ICC).

[23]  Steven Whitehouse.  The GFS2 Filesystem , 2010 .

[24]  Nihar B. Shah,et al.  Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction , 2010, IEEE Transactions on Information Theory.

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

[26]  Jian Lin,et al.  CORE: Augmenting regenerating-coding-based recovery for single and concurrent failures in distributed storage systems , 2013, 2013 IEEE 29th Symposium on Mass Storage Systems and Technologies (MSST).