Coding and Maintenance Strategies for Cloud Storage: Correlated Failures, Mobility and Architecture Awareness

[1]  O. Ozan Koyluoglu,et al.  A General Construction for PMDS Codes , 2017, IEEE Communications Letters.

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

[3]  Cheng Huang,et al.  Explicit Maximally Recoverable Codes With Locality , 2013, IEEE Transactions on Information Theory.

[4]  Kenneth W. Shum,et al.  Sector-disk codes and partial MDS codes with up to three global parities , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[5]  Yunnan Wu,et al.  Network coding for distributed storage systems , 2010, IEEE Trans. Inf. Theory.

[6]  Andreas Haeberlen,et al.  Efficient Replica Maintenance for Distributed Storage Systems , 2006, NSDI.

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

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

[9]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[10]  Cheng Huang,et al.  In Search of I/O-Optimal Recovery from Disk Failures , 2011, HotStorage.

[11]  Mingqiang Li,et al.  STAIR Codes: A General Family of Erasure Codes for Tolerating Device and Sector Failures , 2014, TOS.

[12]  Wilson C. Hsieh,et al.  Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.

[13]  Chao Tian,et al.  Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs , 2014, IEEE Transactions on Information Theory.

[14]  C. Colbourn,et al.  Handbook of Combinatorial Designs , 2006 .

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

[16]  Kannan Ramchandran,et al.  Fractional repetition codes for repair in distributed storage systems , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[17]  Mario Blaum,et al.  Construction of two SD Codes , 2013, ArXiv.

[18]  Mario Blaum,et al.  Generalized Concatenated Types of Codes for Erasure Correction , 2014, ArXiv.

[19]  Alexandre Graell i Amat,et al.  Distributed Storage in Mobile Wireless Networks With Device-to-Device Communication , 2016, IEEE Transactions on Communications.

[20]  John Kubiatowicz,et al.  Erasure Coding Vs. Replication: A Quantitative Comparison , 2002, IPTPS.

[21]  Nihar B. Shah,et al.  Enabling node repair in any erasure code for distributed storage , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[22]  Onur Ozan Koyluoglu,et al.  Repairable Block Failure Resilient codes , 2014, 2014 IEEE International Symposium on Information Theory.

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

[24]  Sriram Vishwanath,et al.  Optimal Locally Repairable and Secure Codes for Distributed Storage Systems , 2012, IEEE Transactions on Information Theory.

[25]  Cheng Huang,et al.  Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[26]  Sriram Vishwanath,et al.  Explicit MBR all-symbol locality codes , 2013, 2013 IEEE International Symposium on Information Theory.

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

[28]  Ben Y. Zhao,et al.  Pond: The OceanStore Prototype , 2003, FAST.

[29]  Stéphane Pérennes,et al.  Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

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

[31]  Itzhak Tamo,et al.  A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.

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

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

[34]  P. Vijay Kumar,et al.  Optimal linear codes with a local-error-correction property , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[36]  Frédérique Oggier,et al.  Self-repairing homomorphic codes for distributed storage systems , 2010, 2011 Proceedings IEEE INFOCOM.

[37]  Rafail Ostrovsky,et al.  Batch codes and their applications , 2004, STOC '04.

[38]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[39]  Mario Blaum,et al.  Sector-Disk (SD) Erasure Codes for Mixed Failure Modes in RAID Systems , 2014, TOS.

[40]  Eitan Yaakobi,et al.  Partial MDS (PMDS) and Sector-Disk (SD) codes that tolerate the erasure of two random sectors , 2014, 2014 IEEE International Symposium on Information Theory.

[41]  Sriram Vishwanath,et al.  Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing , 2016, IEEE Transactions on Information Theory.

[42]  Sriram Vishwanath,et al.  Error resilience in distributed storage via rank-metric codes , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[44]  Sriram Vishwanath,et al.  Secure Cooperative Regenerating Codes for Distributed Storage Systems , 2012, IEEE Transactions on Information Theory.

[45]  P. Vijay Kumar,et al.  Codes With Local Regeneration and Erasure Correction , 2014, IEEE Transactions on Information Theory.

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

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

[48]  Camilla Hollanti,et al.  Distributed storage for proximity based services , 2012, 2012 Swedish Communication Technologies Workshop (Swe-CTW).

[49]  Richard C. Singleton,et al.  Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.

[50]  Camilla Hollanti,et al.  Device-to-device data storage for mobile cellular systems , 2013, 2013 IEEE Globecom Workshops (GC Wkshps).

[51]  Dimitris S. Papailiopoulos,et al.  Locally Repairable Codes , 2014, IEEE Trans. Inf. Theory.

[52]  B. Eisenberg.  On the expectation of the maximum of IID geometric random variables , 2008 .

[53]  Garth A. Gibson.  Redundant disk arrays: Reliable, parallel secondary storage. Ph.D. Thesis , 1990 .

[54]  Cheng Huang,et al.  On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.

[55]  Mario Blaum,et al.  Partial-MDS Codes and Their Application to RAID Type of Architectures , 2012, IEEE Transactions on Information Theory.

[56]  Eitan Yaakobi,et al.  Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols , 2016, IEEE Transactions on Information Theory.