Beyond the MDS bound in distributed cloud storage

Distributed storage plays a crucial role in the current cloud computing framework. After the theoretical bound for distributed storage was derived by the pioneer work of the regenerating code, Reed-Solomon code based regenerating codes were developed. The RS code based minimum storage regeneration code (RS-MSR) and the RS code based minimum bandwidth regeneration code (RS-MBR) can achieve the theoretical bounds on the MSR point and the MBR point respectively in code regeneration. They can also maintain the MDS property in code reconstruction. However, in the hostile network where the storage nodes can be compromised and the packets can be tampered with, the storage capacity of the network can be significantly affected. In this paper, we propose a Hermitian code based regenerating (H-MSR) code. We first prove that this code can achieve the theoretical MSR bound. We then propose data regeneration and reconstruction algorithms for the H-MSR code in both error-free network and hostile network. Theoretical evaluation shows that our proposed schemes can detect the erroneous decodings and correct more errors in the hostile network than the RS-MSR code with the same code rate. Our analysis also demonstrates that the proposed H-MSR code has a lower complexity than the RS-MSR code in both code regeneration and code reconstruction.

[1]  Sidharth Jaggi,et al.  Design and analysis of network codes , 2005 .

[2]  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.

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

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

[5]  Reihaneh Safavi-Naini,et al.  An efficient code for Adversarial Wiretap channel , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[6]  C. Heegard,et al.  On the structure of Hermitian codes , 1997 .

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

[8]  Kannan Ramchandran,et al.  Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks , 2010, IEEE Transactions on Information Theory.

[9]  Yunnan Wu,et al.  Reducing repair traffic for erasure coding-based storage via interference alignment , 2009, 2009 IEEE International Symposium on Information Theory.

[10]  A. Dimakis,et al.  Deterministic Regenerating Codes for Distributed Storage Yunnan , 2007 .

[11]  Oliver Kosut,et al.  On generalized active attacks by causal adversaries in networks , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[12]  Kannan Ramchandran,et al.  Regenerating codes for errors and erasures in distributed storage , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[13]  Jien Ren.  On the structure of Hermitian codes and decoding for burst errors , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

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

[15]  Ben Y. Zhao,et al.  Maintenance-Free Global Data Storage , 2001, IEEE Internet Comput..

[16]  Michael Langberg,et al.  Adversarial models and resilient schemes for network coding , 2008, 2008 IEEE International Symposium on Information Theory.

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

[18]  Ernst W. Biersack,et al.  A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.