MDS array codes with optimal rebuilding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 1240-1244

  Tamo, Itzhak ^a,b   Wang, Zhiying ^a   Bruck, Jehoshua ^a  

^a California Institute of Technology   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AMOUNT OF INFORMATION; ARRAY CODES; CORRECTING CODES; EFFICIENT ENCODING; ERASURE CORRECTING; FINITE FIELDS; MDS CODE; OPEN PROBLEMS; RATIO PROBLEM; STORAGE SYSTEMS;

INFORMATION THEORY;

OPTIMIZATION;

EID: 80054827910     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033733     Document Type: Conference Paper

References (19)

1. M. Blaum, J. Brady, J. Bruck, and J. Menon, "EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures", IEEE Trans. on Computers, vol. 44, no. 2, pp. 192-202, Feb. 1995.
2. M. Blaum, J. Bruck, and E. Vardy, "MDS array codes with independent parity symbols", IEEE Trans. on Information Theory, vol. 42, pp. 529-542, 1996.
3. L. Xu, V. Bohossian, J. Bruck, and D. Wagner, "Low-density MDS codes and factors of complete graphs", IEEE Trans. on Information Theory, vol. 45, no. 6, pp. 1817-1826, Sep. 1999.
4. L. Xu and J. Bruck, "X-code: MDS array codes with optimal encoding", IEEE Trans. on Information Theory, vol. 45, no. 1, pp. 272-276, 1999.
5. P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar, "Row-diagonal parity for double disk failure correction", in Proc. of the 3rd USENIX Symposium on File and Storage Technologies (FAST 04), 2004.
6. C. Huang and L. Xu, "STAR: an efficient coding scheme for correcting triple storage node failures", IEEE Trans. on Computers, vol. 57, no. 7, pp. 889-901, 2008.
7. A. Dimakis, P. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems", IEEE Trans. on Information Theory, vol. 56, no. 9, pp. 4539-4551, 2010.
8. Y. Wu, R. Dimakis, and K. Ramchandran, "Deterministic regenerating codes for distributed storage", in Allerton Conference on Control, Computing, and Communication, Urbana-Champaign, IL, 2007.
9. Y. Wu, "Existence and construction of capacity-achieving network codes for distributed storage", in ISIT, 2009.
10. Y. Wu and A. Dimakis, "Reducing repair traffic for erasure coding-based storage via interference alignment", in ISIT, 2009.
11. K. V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran, "Explicit construction of optimal exact regenerating codes for distributed storage", Tech Rep. arXiv:0906.4913, 2009.
12. C. Suh and K. Ramchandran, "Exact regeneration codes for distributed storage repair using interference alignment", Tech. Rep. arXiv:1001.0107, Jan 2010.
13. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Explicit codes minimizing repair bandwidth for distributed storage", in IEEE Information Theory Workshop (ITW), Jan. 2010.
14. C. Suh and K. Ramchandran, "On the existence of optimal exact-repair MDS codes for distributed storage", Tech. Rep. arXiv:1004.4663, 2010.
15. V. R. Cadambe, S. A. Jafar, and H. Maleki, "Distributed data storage with minimum storage regenerating codes - exact and functional repair are asymptotically equally efficient", Tech. Rep. arXiv:1004.4299, 2010.
16. K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Enabling node repair in any erasure code for distributed storage." Tech. Rep. arXiv:1101.0133, 2010.
17. Z. Wang, A. G. Dimakis, and J. Bruck, "Rebuilding for array codes in distributed storage systems", in IEEE GLOBECOM Workshops, pp. 1905-1909, Dec. 2010.
18. L. Xiang, Y. Xu, J. C. S. Lui, and Q. Chang, "Optimal recovery of single disk failure in RDP code storage systems", in ACM SIGMETRICS, pp. 119-130, 2010.
19. I. Tamo, Z. Wang, and J. Bruck, "MDS array codes with optimal rebuilding." Tech. Rep. Available at paradise.caltech.edu/etr.html