Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction

IEEE Transactions on Information Theory

Volumn 57, Issue 8, 2011, Pages 5227-5239

  Rashmi, K V ^a   Shah, Nihar B ^a   Kumar, P Vijay ^a,b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Distributed storage; interference alignment; network coding; node repair; partial data recovery; product matrix framework; regenerating codes

Indexed keywords

DISTRIBUTED STORAGE; INTERFERENCE ALIGNMENT; NODE REPAIR; PARTIAL DATA; PRODUCT-MATRIX FRAMEWORK; REGENERATING CODES;

MATRIX ALGEBRA; OPTIMIZATION; REPAIR;

NETWORK CODING;

EID: 79961002025     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2159049     Document Type: Article

References (22)

1. D. A. Patterson, G. Gibson, and R. H. Katz, "A case for redundant arrays of inexpensive disks (RAID)," in Proc. ACMSIGMOD Int. Conf. Management of Data, Chicago, IL, Jun. 1988, pp. 109-116.
2. S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubiatowicz, "Pond: The OceanStore prototype," in Proc. 2nd USENIX Conf. File and Storage Technologies (FAST), 2003, pp. 1-14.
3. R. Bhagwan, K. Tati, Y. C. Cheng, S. Savage, and G. M. Voelker, "Total recall: System support for automated availability management," in Proc. 1st Conf. Networked Systems Design and Implementation (NSDI), 2004.
4. A. G. Dimakis, P. B. Godfrey, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," in Proc. 26th IEEE Int. Conf. Computer Communications (INFOCOM), Anchorage, AK, May 2007, pp. 2000-2008. (Pubitemid 47334432)
5. Y. Wu, A. G. Dimakis, and K. Ramchandran, "Deterministic regenerating codes for distributed storage," in Proc. 45th Annu. Allerton Conf. Control, Computing, and Communication, Urbana-Champaign, IL, Sep. 2007.
6. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Explicit codes minimizing repair bandwidth for distributed storage," in Proc. IEEE Information Theory Workshop (ITW), Cairo, Egypt, Jan. 2010.
7. C. Suh and K. Ramchandran, "Exact-repair MDS codes for distributed storage using interference alignment," in Proc. IEEE Int. Symp. Information Theory (ISIT), Austin, TX, Jun. 2010, pp. 161-165.
8. Y. Wu, "Existence and construction of capacity-achieving network codes for distributed storage," IEEE J. Select. Areas Commun., vol. 28, no. 2, pp. 277-288, Feb. 2010.
9. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4539-4551, Sep. 2010.
10. A. Duminuco and E. Biersack, "A practical study of regenerating codes for peer-to-peer backup systems," in Proc. 29th IEEE Int. Conf. Distributed Computing Systems (ICDCS), Jun. 2009, pp. 376-384.
11. Y. Wu and A. Dimakis, "Reducing repair traffic for erasure coding-based storage via interference alignment," in Proc. IEEE Int. Symp. Information Theory (ISIT), Seoul, South Korea, Jul. 2009, pp. 2276-2280.
12. K. V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran, "Explicit construction of optimal exact regenerating codes for distributed storage," in Proc. 47th Annu. Allerton Conf. Communication, Control, and Computing, Urbana-Champaign, IL, Sep. 2009, pp. 1243-1249.
13. D. Cullina, A. G. Dimakis, and T. Ho, "Searching for minimum storage regenerating codes," in Proc. 47th Annu. Allerton Conf. Communication, Control, and Computing, Urbana-Champaign, IL, Sep. 2009.
14. 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. Inf. Theory, submitted for publication.
15. Y.Wu, "A construction of systematic MDScodes with minimum repair bandwidth," IEEE Trans. Inf. Theory, submitted for publication.
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 [Online]. Available: arXiv:1004.4299 [cs.IT]
17. C. Suh and K. Ramchandran, On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage [Online]. Available: arXiv:1004.4663 [cs.IT]
18. N. B. Shah, K. V. Rashmi, and P. V. Kumar, "A flexible class of regenerating codes for distributed storage," in Proc. IEEE Int. Symp. Information Theory (ISIT), Austin, TX, Jun. 2010, pp. 1943-1947.
19. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Distributed storage codes with repair-by-transfer and non-achievability of interior points on the storage-bandwidth tradeoff," IEEE Trans. Inf. Theory, submitted for publication.
20. D. S. Bernstein, Matrix Mathematics: Theory, Facts, and Formulas With Application to Linear Systems Theory. Princeton, NJ: Princeton University Press, 2005.
21. M. Maddah-Ali, A. Motahari, and A. Khandani, "Communication over MIMO X channels: Interference alignment, decomposition, and performance analysis," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3457-3470, Aug. 2008.
22. V. Cadambe and S. Jafar, "Interference alignment and spatial degrees of freedom for the k user interference channel," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3425-3441, Aug. 2008.