Interference alignment in regenerating codes for distributed storage: Necessity and code constructions

IEEE Transactions on Information Theory

Volumn 58, Issue 4, 2012, Pages 2134-2158

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

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Distributed storage; interference alignment; maximum distance separable (MDS) regenerating codes; network coding; node repair; partial data recovery

Indexed keywords

CODE CONSTRUCTION; CUT-SET BOUND; DATA FILES; DATA RECOVERY; DISTRIBUTED STORAGE; EXPLICIT CONSTRUCTIONS; FAILED NODES; HIGH RATE; INTERFERENCE ALIGNMENT; MAXIMUM DISTANCE SEPARABLE CODE; MAXIMUM-DISTANCE-SEPARABLE (MDS) REGENERATING CODES; MDS CODE; NETWORK STORAGE; PARTIAL DATA;

BANDWIDTH; NETWORK CODING; REED-SOLOMON CODES;

REPAIR;

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

References (25)

1. 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.
2. 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. Symposium on Networked Systems Design and Implementation (NSDI), 2004.
3. Wuala-Secure Online Storage [Online]. Available: Http://www. wuala.com
4. A. G. Dimakis, P. B. Godfrey, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," in Proc. 26th IEEE International Conf. Computer Communications (INFOCOM), Anchorage, May 2007, pp. 2000-2008. (Pubitemid 47334432)
5. 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, 2010.
6. Y. Wu, A. G. Dimakis, and K. Ramchandran, "Deterministic regenerating codes for distributed storage," in Proc. 45th Ann. Allerton Conf. Control, Computing, and Communication, Urbana-Champaign, Sep. 2007.
7. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Interference alignment as a tool in network coding as applied to distributed storage," in National Conf. Communications (NCC), Chennai, Jan. 2010.
8. Y. Wu and A. Dimakis, "Reducing repair traffic for erasure codingbased storage via interference alignment," in Proc. IEEE Int. Symp. Information Theory (ISIT), Seoul, Jul. 2009, pp. 2276-2280.
9. 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 Ann. Allerton Conf. Communication, Control, and Computing, Urbana-Champaign, Sep. 2009, pp. 1243-1249.
10. 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, Jan. 2010.
11. 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, Sep. 2009.
12. 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.
13. K. V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran, "Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage," in Proc. IEEE Int. Symp. Information Theory (ISIT), Austin, Jun. 2010, pp. 1938-1942.
14. C. Suh and K. Ramchandran, "Exact-repair MDS code construction using interference alignment," IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1425-1442, Mar. 2011.
15. K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for the MSR and MBR points via a product-matrix construction," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5227-5239, Aug. 2011.
16. B. Gastón and J. Pujol, Double Circulant Minimum Storage Regenerating Codes 2010, arXiv:1007.2401 [cs.IT].
17. 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.
18. 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.
19. 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 arXiv:1004.4299 [cs.IT].
20. C. Suh and K. Ramchandran, On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage arXiv:1004.4663 [cs.IT].
21. 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.
22. 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.
23. D. S. Bernstein, Matrix Mathematics: Theory, Facts, and Formulas With Application to Linear Systems Theory. : Princeton University Press, 2005.
24. F.MacWilliams and N. Sloane, The Theory of Error-Correcting Codes, Part I. : North-Holland, 1977.
25. K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Enabling node repair in any erasure code for distributed storage," in Proc. IEEE Int. Symp. Information Theory (ISIT), Jul. 2011, arXiv:1008.0064 [cs.IT].