Distributed Storage Codes Based on Double- Layered Piggybacking Framework

Piggybacking codes are a class of distributed storage codes adopted in distributed storage systems, which received much attention in recent years. Two novel piggybacking constructions based on the double-layered piggybacking framework are proposed. They can reduce the repair bandwidth of both the systematic nodes and the parity nodes efficiently. The average repair bandwidth ratio for the two constructions approaches to zero asymptotically as the number of systematic nodes and parity nodes tends to infinity. Compared with other piggybacking codes, the two proposed double-layered piggybacking codes, especially the second one, not only require less design constraints, but also obtain the optimal comprehensive repair efficiency, which further save the amount of data read and downloaded.

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

[2]  Derrick Wing Kwan Ng,et al.  Key technologies for 5G wireless systems , 2017 .

[3]  Shuai Yuan,et al.  Generalized Piggybacking Codes for Distributed Storage Systems , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[4]  Kenneth W. Shum,et al.  Fractional Repetition Codes With Optimal Reconstruction Degree , 2020, IEEE Transactions on Information Theory.

[5]  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).

[6]  Peter F. Corbett,et al.  Row-Diagonal Parity for Double Disk Failure Correction (Awarded Best Paper!) , 2004, USENIX Conference on File and Storage Technologies.

[7]  Cheng Huang,et al.  Erasure Coding in Windows Azure Storage , 2012, USENIX Annual Technical Conference.

[8]  Van-Anh Truong,et al.  Availability in Globally Distributed Storage Systems , 2010, OSDI.

[9]  Weisong Shi,et al.  Edge Computing: Vision and Challenges , 2016, IEEE Internet of Things Journal.

[10]  Ju Wang,et al.  Windows Azure Storage: a highly available cloud storage service with strong consistency , 2011, SOSP.

[11]  Jehoshua Bruck,et al.  Access Versus Bandwidth in Codes for Storage , 2014, IEEE Transactions on Information Theory.

[12]  Raja Lavanya,et al.  Fog Computing and Its Role in the Internet of Things , 2019, Advances in Computer and Electrical Engineering.

[13]  Alexandros G. Dimakis,et al.  Rebuilding for array codes in distributed storage systems , 2010, 2010 IEEE Globecom Workshops.

[14]  Dimitris S. Papailiopoulos,et al.  Simple regenerating codes: Network coding for cloud storage , 2011, 2012 Proceedings IEEE INFOCOM.

[15]  Bianca Schroeder,et al.  Understanding disk failure rates: What does an MTTF of 1,000,000 hours mean to you? , 2007, TOS.

[16]  Yi-Sheng Su,et al.  On Constructions of a Class of Binary Locally Repairable Codes With Multiple Repair Groups , 2017, IEEE Access.

[17]  Cheng Huang,et al.  STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures , 2005, IEEE Transactions on Computers.

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

[19]  Qin Huang,et al.  A Repair-Efficient Coding for Distributed Storage Systems Under Piggybacking Framework , 2018, IEEE Transactions on Communications.

[20]  Jehoshua Bruck,et al.  Low density MDS codes and factors of complete graphs , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[21]  Jehoshua Bruck,et al.  Zigzag Codes: MDS Array Codes With Optimal Rebuilding , 2011, IEEE Transactions on Information Theory.

[22]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[23]  Jie Li,et al.  A Systematic Piggybacking Design for Minimum Storage Regenerating Codes , 2014, IEEE Transactions on Information Theory.

[24]  Baochun Li,et al.  Erasure coding for cloud storage systems: A survey , 2013 .

[25]  Gennian Ge,et al.  A new piggybacking design for systematic MDS storage codes , 2016, Designs, Codes and Cryptography.

[26]  John C. S. Lui,et al.  Optimal recovery of single disk failure in RDP code storage systems , 2010, SIGMETRICS '10.

[27]  Kannan Ramchandran,et al.  A “Hitchhiker’s” Guide to Fast and Efficient Data Reconstruction in Erasure-coded Data Centers , 2014 .

[28]  Jehoshua Bruck,et al.  X-Code: MDS Array Codes with Optimal Encoding , 1999, IEEE Trans. Inf. Theory.

[29]  Kannan Ramchandran,et al.  Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff , 2010, IEEE Transactions on Information Theory.

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

[31]  Kannan Ramchandran,et al.  Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage , 2013, IEEE Transactions on Information Theory.

[32]  Dimitris S. Papailiopoulos,et al.  XORing Elephants: Novel Erasure Codes for Big Data , 2013, Proc. VLDB Endow..

[33]  Kannan Ramchandran,et al.  A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster , 2013, HotStorage.

[34]  Dimitris S. Papailiopoulos,et al.  Locally Repairable Codes , 2012, IEEE Transactions on Information Theory.

[35]  Kannan Ramchandran,et al.  A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes , 2017, IEEE Transactions on Information Theory.

[36]  Cheng Huang,et al.  Rethinking erasure codes for cloud file systems: minimizing I/O for recovery and degraded reads , 2012, FAST.

[37]  Dimitris S. Papailiopoulos,et al.  Repair Optimal Erasure Codes Through Hadamard Designs , 2011, IEEE Transactions on Information Theory.

[38]  Masoud Ardakani,et al.  An Efficient Binary Locally Repairable Code for Hadoop Distributed File System , 2014, IEEE Communications Letters.

[39]  Jehoshua Bruck,et al.  EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.

[40]  Kannan Ramchandran,et al.  On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage , 2010, ArXiv.

[41]  Alexandre Graell i Amat,et al.  A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).