Simple regenerating codes: Network coding for cloud storage

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 2801-2805

  Papailiopoulos, Dimitris S ^a   Luo, Jianqiang ^b   Dimakis, Alexandros G ^a   Huang, Cheng ^c   Li, Jin ^c  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b EMC Data Domain ^*  (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING SCHEME; DATA RATES; DISTRIBUTED STORAGE; DISTRIBUTED STORAGE SYSTEM; ENCODED INFORMATION; EXPLICIT CONSTRUCTIONS; FAILED NODES; HIGH DATA RATE; LOW COSTS; NETWORK CODES; STORAGE EFFICIENCY;

MULTIPROCESSING SYSTEMS; NETWORK CODING; REED-SOLOMON CODES;

REPAIR;

EID: 84861602545     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195703     Document Type: Conference Paper

References (22)

1. The Coding for Distributed Storage wiki http://tinyurl.com/storagecoding
2. A. G. Dimakis, P. G. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," in IEEE Trans. on Inform. Theory, vol. 56, pp. 4539-4551, Sep. 2010.
3. A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, "A survey on network codes for distributed storage," in IEEE Proceedings, vol. 99, pp. 476-489, Mar. 2011.
4. A. Asterjadhi, E. Fasolo, M. Rossi, J. Widmer, and M. Zorzi. "Towards network coding-based protocols for data broadcasting in wireless ad hoc networks." in IEEE Transactions on Wireless Commun., vol. 9, pp. 662-673, Feb. 2010
5. C. Gkantsidis, J. Miller, and P. Rodriguez, "Comprehensive view of a live network coding P2P system," in IMC, Association for Computing Machinery, Inc., Oct 2006
6. O. Khan, R. Burns, J. Plank, and C. Huang, "In search of I/O-optimal recovery from disk failures," to appear in Hot Storage 2011, 3rd Workshop on Hot Topics in Storage and File Systems, Portland, OR, Jun., 2011.
7. H. Weatherspoon and J. D. Kubiatowicz, "Erasure coding vs. replication: a quantitative comparison," in Proc. IPTPS, 2002.
8. M. Blaum, J. Brady, J. Bruck, and J. Menon, "EVENODD: An efficient scheme for tolerating double disk failures in raid architectures," in IEEE Transactions on Computers, 1995.
9. L. Xiang, Y. Xu, J.C.S. Lui, and Q. Chang, "Optimal recovery of single disk failure in RDP code storage systems" in Proc. ACM SIGMETRICS (2010) international conference on Measurement and modeling of computer systems
10. F. Oggier and A. Datta, "Self-repairing homomorphic codes for distributed storage systems," in Proc. IEEE Infocom 2011, Shanghai, China, Apr. 2011.
11. K.V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran "Explicit construction of optimal exact regenerating codes for distributed storage,"In Allerton Conf. on Control, Comp., and Comm., Urbana-Champaign, IL, September 2009.
12. C. Suh and K. Ramchandran, "Exact regeneration codes for distributed storage repair using interference alignment," in Proc. 2010 IEEE Int. Symp. on Inform. Theory (ISIT), Seoul, Korea, Jun. 2010.
13. K. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction," submitted to IEEE Transactions on Information Theory. Preprint available at at http://arxiv.org/pdf/1005.4178.
14. S. El Rouayheb and K. Ramchandran, "Fractional repetition codes for repair in distributed storage systems," in Proc. of 48th Allerton Conf. on Commun., Control and Comp., Monticello, IL, September 2010.,"
15. I. Tamo, Z. Wang, and J. Bruck, "MDS array codes with optimal rebuilding," to appear in 2011 IEEE Symposium on Information Theory (ISIT). Preprint available at http://arxiv.org/abs/1103.3737
16. V. R. Cadambe, C. Huang, S. A. Jafar, and J. Li, "Optimal repair of MDS codes in distributed storage via subspace interference alignment,"arxiv pre-print 2011. Preprint available at http://arxiv.org/abs/1106.1250.
17. K. W. Shum and Y. Hu, "Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systems," to appear in 2011 IEEE Symposium on Information Theory (ISIT). Preprint available at http://arxiv.org/abs/1102.1609.
18. D. S. Papailiopoulos, A. G. Dimakis, and V. R. Cadambe, "Repair optimal erasure codes through Hadamard designs," Preprint available at http://arxiv.org/abs/1106.1634v1.
19. S. Ghemawat, H. Gobioff, and S.-T. Leung, "The Google file system,"in SOSP '03: Proc. of the 19th ACM Symposium on Operating Systems Principles, 2003.
20. K. Shvachko, H. Kuang, S. Radia, and R. Chansler, "The Hadoop distributed file system," in MSST '10: Proc. of the 26th IEEE Symposium on Massive Storage Systems and Technologies, 2010.
21. Q. Xin, E. L. Miller, D. D. E. Long, S. A. Brandt, T. Schwarz, and W. Litwin, "Reliability mechanisms for very large storage systems,"in MSST '03: Proc. of the 20th IEEE Symposium on Massive Storage Systems and Technologies, 2003.
22. D. Ford, F. Labelle, F. I. Popovici, M. Stokely, V.-A. T. L. Barroso, C. Grimes, and S. Quinlan, "Availability in globally distributed storage systems," in OSDI '10: Proc. of the 9th Usenix Symposium on Operating Systems Design and Implementation, 2010.