Cooperative repair with minimum-storage regenerating codes for distributed storage

Proceedings - IEEE INFOCOM

Volumn , Issue , 2014, Pages 316-324

  Li, Jun ^a   Li, Baochun ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; CODES (SYMBOLS); DIGITAL STORAGE; MULTIPROCESSING SYSTEMS;

BANDWIDTH CONSUMPTION; DISTRIBUTED STORAGE; DISTRIBUTED STORAGE SYSTEM; MULTIPLE FAILURES; NEW CONSTRUCTIONS; OPTIMAL BANDWIDTHS; REDUNDANT DATA; REGENERATING CODES;

REPAIR;

EID: 84904420687     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2014.6847953     Document Type: Conference Paper

References (23)

1. D. Borthakur, "HDFS Architecture Guide," Hadoop Apache Project, 2008. [Online]. Available: http://hadoop.apache.org/common/docs/current/hdfs design.pdf
2. B. Calder, J. Wang, A. Ogus, N. Nilakantan, A. Skjolsvold, S. McKelvie, Y. Xu, S. Srivastav, J. Wu, H. Simitci, J. Haridas, C. Uddaraju, H. Khatri, A. Edwards, V. Bedekar, S. Mainali, R. Abbasi, A. Agarwal, M. F. ul Haq, M. I. ul Haq, D. Bhardwaj, S. Dayanand, A. Adusumilli, M. McNett, S. Sankaran, K. Manivannan, and L. Rigas, "Windows Azure Storage: A Highly Available Cloud Storage Service with Strong Consistency," in Proc. of ACM Symposium on Operating Systems Principles (SOSP), 2011.
3. C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin, "Erasure Coding in Windows Azure Storage," in Proc. USENIX Annual Technical Conference (USENIX ATC), 2012.
4. M. Sathiamoorthy, M. Asteris, D. Papailiopoulos, A. G. Dimakis, R. Vadali, S. Chen, and D. Borthakur, "XORing Elephants: Novel Erasure Codes for Big Data," Proc. VLDB Endowment (to appear), 2013.
5. I. Reed and G. Solomon, "Polynomial Codes over Certain Finite Fields," Journal of the Society for Industrial and Applied Mathematics, vol. 8, no. 2, pp. 300-304, 1960.
6. K. V. Rashmi, N. B. Shah, D. Gu, H. Kuang, D. Borthakur, and K. Ramchandran, "A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster," in Proc. 5th USENIX Workshop on Hot Topics in Storage and File Systems, 2013.
7. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network Coding for Distributed Storage Systems," IEEE Trans. Inform. Theory, vol. 56, no. 9, pp. 4539-4551, 2010.
8. R. Bhagwan, K. Tati, Y.-C. Cheng, S. Savage, and G. M. Voelker, "Total Recall: System Support for Automated Availability Management," in Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2004.
9. Y. Hu, Y. Xu, X. Wang, C. Zhan, and P. Li, "Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding," IEEE Journal on Selected Areas in Communications, vol. 28, no. 2, pp. 268-276, 2010.
10. K. W. Shum, "Cooperative Regenerating Codes for Distributed Storage Systems," in Proc. IEEE International Conference on Communications (ICC), 2011.
11. A. Wang and Z. Zhang, "Exact Cooperative Regenerating Codes with Minimum-Repair-Bandwidth for Distributed Storage," in Proc. IEEE INFOCOM, 2013.
12. 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 Product-Matrix Construction," IEEE Trans. Inform. Theory, vol. 57, no. 8, pp. 5227-5239, 2011.
13. Y. Wu and A. Dimakis, "Reducing Repair Traffic for Erasure Codingbased Storage via Interference Alignment," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), 2009.
14. Y. Wu, A. G. Dimakis, and K. Ramchandran, "Deterministic Regenerating Codes for Distributed Storage," Allerton Conference on Control, Computing, and Communication, 2007.
15. Y. Wu, "Existence and Construction of Capacity-Achieving Network Codes for Distributed Storage," IEEE Journal on Selected Areas in Communications, vol. 28, no. 2, pp. 277-288, 2010.
16. 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," in Proc. 2010 Wireless Network Coding (WINC) Workshop, 2010.
17. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions," IEEE Trans. on Inform. Theory, vol. 58, no. 4, pp. 2134-2158, 2012.
18. N. B. Shah, K. V. Rashmi, P. Vijay Kumar, and K. Ramchandran, "Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff," IEEE Trans. on Inform. Theory,, vol. 58, no. 3, pp. 1837-1852, 2012.
19. A. Kermarrec and N. Le, "Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes," IEEE International Symposium on Network Coding (NetCod), 2011.
20. N. Le Scouarnec, "Exact Scalar Minimum Storage Coordinated Regenerating Codes," Proc. IEEE International Symposium on Information Theory (ISIT), 2012.
21. J. Chen and K. W. Shum, "Repairing Multiple Failures in the Suh-Ramchandran Regenerating Codes," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), 2013.
22. T. Andreescu and R. Gelca, Mathematical Olympiad Challenges. Springer, 2000.
23. Y. S. Han, H.-T. Pai, R. Zheng, and P. K. Varshney, "Update- Efficient Regenerating Codes with Minimum Per-Node Storage," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), 2013.