Optimal locally repairable codes and connections to matroid theory

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 1814-1818

  Tamo, Itzhak ^a,b   Papailiopoulos, Dimitris S ^c   Dimakis, Alexandros G ^c  

^a UNIVERSITY OF MARYLAND   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED ENVIRONMENTS; DISTRIBUTED STORAGE SYSTEM; EXISTENCE RESULTS; EXPLICIT CONSTRUCTIONS; GENERATOR MATRIX; HADOOP DISTRIBUTED FILE SYSTEMS; LARGE-SCALE DISTRIBUTED STORAGE; STORAGE EFFICIENCY;

COMBINATORIAL MATHEMATICS; INFORMATION THEORY; MATRIX ALGEBRA; MULTIPROCESSING SYSTEMS; OPTIMIZATION; REPAIR; WINDOWS OPERATING SYSTEM;

OPTIMAL SYSTEMS;

EID: 84890371525     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620540     Document Type: Conference Paper

References (21)

1. H. Weatherspoon and J. Kubiatowicz, "Erasure coding vs. replication: A quantitative comparison, " Peer-to-Peer Systems, pp. 328-337, 2002.
2. C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin, "Erasure coding in windows azure storage, " in USENIX Annual Technical Conference (USENIX ATC), 2012.
3. M. Sathiamoorthy, M. Asteris, D. Papailiopoulos, A. G. Dimakis, R. Vadali, S. Chen, and D. Borthakur, "XORing elephants: Novel erasure codes for big data, " Proceedings of the VLDB Endowment (to appear), 2013.
4. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems, " Information Theory, IEEE Transactions on, vol. 56, no. 9, pp. 4539-4551, 2010.
5. K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for distributed storage at the msr and mbr points via a productmatrix construction, " Information Theory, IEEE Transactions on, vol. 57, no. 8, pp. 5227-5239, 2011.
6. C. Suh and K. Ramchandran, "Exact-repair mds code construction using interference alignment, " Information Theory, IEEE Transactions on, vol. 57, no. 3, pp. 1425-1442, 2011.
7. I. Tamo, Z. Wang, and J. Bruck, "Mds array codes with optimal rebuilding, " in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, pp. 1240-1244, IEEE, 2011.
8. V. R. Cadambe, C. Huang, S. A. Jafar, and J. Li, "Optimal repair of mds codes in distributed storage via subspace interference alignment, " arXiv preprint arXiv:1106. 1250, 2011.
9. D. S. Papailiopoulos, A. G. Dimakis, and V. R. Cadambe, "Repair optimal erasure codes through hadamard designs, " in Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on, pp. 1382-1389, IEEE, 2011.
10. O. Khan, R. Burns, J. Plank, and C. Huang, "In search of i/o-optimal recovery from disk failures, " in Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems, pp. 6-6, USENIX Association, 2011.
11. P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, "On the locality of codeword symbols, " Information Theory, IEEE Transactions on, vol. 58, no. 11, pp. 6925-6934, 2011.
12. F. Oggier and A. Datta, "Self-repairing homomorphic codes for distributed storage systems, " in INFOCOM, 2011 Proceedings IEEE, pp. 1215-1223, IEEE, 2011.
13. D. S. Papailiopoulos, J. Luo, A. G. Dimakis, C. Huang, and J. Li, "Simple regenerating codes: Network coding for cloud storage, " in INFOCOM, 2012 Proceedings IEEE, pp. 2801-2805, IEEE, 2012.
14. J. Han and L. A. Lastras-Montano, "Reliable memories with subline accesses, " in Information Theory, 2007. ISIT 2007. IEEE International Symposium on, pp. 2531-2535, IEEE, 2007.
15. C. Huang, M. Chen, and J. Li, "Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems, " in Network Computing and Applications, 2007. NCA 2007. Sixth IEEE International Symposium on, pp. 79-86, IEEE, 2007.
16. D. S. Papailiopoulos and A. G. Dimakis, "Locally repairable codes, " in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, pp. 2771-2775, IEEE, 2012.
17. N. Prakash, G. M. Kamath, V. Lalitha, and P. V. Kumar, "Optimal linear codes with a local-error-correction property, " in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, pp. 2776-2780, IEEE, 2012.
18. G. M. Kamath, N. Prakash, V. Lalitha, and P. V. Kumar, "Codes with local regeneration, " arXiv preprint arXiv:1211. 1932, 2012.
19. A. Rawat, O. Koyluoglu, N. Silberstein, and S. Vishwanath, "Optimal locally repairable and secure codes for distributed storage systems, " arXiv preprint arXiv:1210. 6954, 2012.
20. A. S. Rawat and S. Vishwanath, "On locality in distributed storage systems, " arXiv preprint arXiv:1204. 6098, 2012.
21. N. Silberstein, A. Singh Rawat, and S. Vishwanath, "Error resilience in distributed storage via rank-metric codes, " CoRR, vol. abs/1202. 0800, 2012.