A Survey on network codes for distributed storage

Proceedings of the IEEE

Volumn 99, Issue 3, 2011, Pages 476-489

  Dimakis, Alexandros G ^a   Ramchandran, Kannan ^b   Wu, Yunnan ^c   Suh, Changho ^b  

^a University of Southern California ^*  (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Distributed storage; erasure coding; interference alignment; multicast; network coding

Indexed keywords

CODES (SYMBOLS); COMPUTER SYSTEM RECOVERY; MULTICASTING; MULTIPROCESSING SYSTEMS; REDUNDANCY; REPAIR;

CODING TECHNIQUES; DESIGN CHALLENGES; DISTRIBUTED STORAGE; DISTRIBUTED STORAGE SYSTEM; ENCODED INFORMATION; ERASURE CODING; INTERFERENCE ALIGNMENT; ORDERS OF MAGNITUDE;

NETWORK CODING;

EID: 79951957726     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2010.2096170     Document Type: Article

References (46)

1. The Coding for Distributed Storage Wiki. [Online]. Available: http://tinyurl.com/storagecoding.
2. H. Weatherspoon and J. D. Kubiatowicz, "Erasure coding vs. replication: A quantitative comparison," in Proc. Int. Workshop Peer-to-Peer Syst., 2002.
3. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao, "OceanStore: An architecture for global-scale persistent storage," in Proc. 9th Int. Conf. Architectural Support Programm. Lang. Oper. Syst., "oston, MA, Nov. 2000, pp. 190-201. (Pubitemid 32470898)
4. S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weatherspoon, and J. Kubiatowicz, "Maintenance-free global data storage," IEEE Internet Comput., pp. 40-49, Sep. 2001. (Pubitemid 32992732)
5. R. Bhagwan, K. Tati, Y.-C. Cheng, S. Savage, and G. M. Voelker, "Total recall: System support for automated availability management," in Proc. Symp. Netw. Syst. Design Implementation, 2004, pp. 337-350.
6. I. Reed and G. Solomon, "Polynomial codes over certain finite fields," J. Soc. Ind. Appl. Math., vol. 8, no. 2, pp. 300-304, Jun. 1960.
7. M. O. Rabin, "Efficient dispersal of information for security, load balancing and fault tolerance," J. Assoc. Comput. Mach., vol. 36, no. 2, pp. 335-348, 1989.
8. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006. (Pubitemid 43898908)
9. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge, U.K.: Cambridge Univ. Press, 2008.
10. M. Blaum, J. Brady, J. Bruck, and J. Menon, "EVENODD: An efficient scheme for tolerating double disk failures in raid architectures," IEEE Trans. Comput., vol. 44, no. 2, pp. 192-202, Feb. 1995.
11. M. Blaum, J. Bruck, and A. Vardy, "MDS array codes with independent parity symbols," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 529-542, Mar. 1996. (Pubitemid 126770506)
12. M. Blaum, P. G. Farrell, and H. Vav Tilborg, "Book chapter on array codes," in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds., 1998.
13. B. Marcus, R. M. Roth, and P. Siegel, "Constrained systems and coding for recording channels," in Handbook of Coding Theory, V. Pless and W. C. Huffman, Eds., 1998, pp. 1635-1764.
14. Z. Wang, A. G. Dimakis, and J. Bruck, "Rebuilding for array codes in distributed storage systems," in Proc. Workshop Appl. Commun. Theory Emerging Memory Technol., 2010. [Online]. Available: http://arxiv.org/abs/1009. 3291.
15. L. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
16. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
17. L. Lima, J. Barros, M. Medard, and A. Toledo, "Protecting the code: Secure multiresolution network coding," in Proc. IEEE Inf. Theory Workshop, 2009.
18. R. Koetter and M. Ḿedard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
19. T. Ho, M. Ḿedard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
20. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for network code construction," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005. (Pubitemid 40843620)
21. C. Fragouli, J. L. Boudec, and J. Widmer, "Network coding: An instant primer," ACM SIGCOMM Comput. Commun. Rev., vol. 36, no. 1, Jan. 2006, DOI:10.1145/1111322.1111337. (Pubitemid 46323585)
22. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005. (Pubitemid 41158597)
23. A. Jiang, "Network coding for joint storage and transmission with minimum cost," in Proc. Int. Symp. Inf. Theory, Jul. 2006, pp. 1359-1363. (Pubitemid 351244319)
24. A. G. Dimakis, P. G. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4539-4551, Sep. 2010.
25. Y. Wu, A. G. Dimakis, and K. Ramchandran, "Deterministic regenerating codes for distributed storage," in Proc. Allerton Conf. Control Comput. Commun., Monticello, IL, Oct. 2007.
26. Y. Wu, "Existence and construction of capacity-achieving network codes for distributed storage," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun. 2009, pp. 1150-1154.
27. Y. Wu, "Existence and construction of capacity-achieving network codes for distributed storage," IEEE J. Sel. Areas Commun., vol. 28, no. 2, pp. 277-288, Feb. 2010.
28. M. A. Maddah-Ali, S. A. Motahari, and A. K. 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.
29. V. R. Cadambe and S. A. Jafar, "Interference alignment and the degrees of freedom for the K user interference channel," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3425-3441, Aug. 2008.
30. C. Suh and D. Tse, "Interference alignment for cellular networks," in Proc. Allerton Conf. Control Comput. Commun., Urbana, IL, Sep. 2008.
31. Y. Wu and A. G. Dimakis, "Reducing repair traffic for erasure coding-based storage via interference alignment," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jul. 2009, pp. 2276-2280.
32. D. Cullina, A. G. Dimakis, and T. Ho, "Searching for minimum storage regenerating codes," in Proc. Allerton Conf. Control Comput. Commun., Urbana, IL, Sep. 2009.
33. K. V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran, "Exact regenerating codes for distributed storage," in Proc. Allerton Conf. Control Comput. Commun., Urbana, IL, Sep. 2009. [Online]. Available: http://arxiv. org/abs/0906.4913.
34. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Explicit codes minimizing repair bandwidth for distributed storage," in Proc. IEEE Inf. Theory Workshop, Jan. 2010, DOI: 10.1109/ITWKSPS.2010.5503165. [Online]. Available: http://arxiv.org/abs/0908.2984.
35. C. Suh and K. Ramchandran, "Exact regeneration codes for distributed storage repair using interference alignment," in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2010. [Online]. Available: http://arxiv.org/abs/1001.0107v2.
36. Y. Wu. (2009, Aug.). A construction of systematic MDS codes with minimum repair bandwidth. IEEE Trans. Inf. Theory. [Online]. Available: http://arxiv.org/abs/0910.2486
37. A. Duminuco and E. Biersack, "A practical study of regenerating codes for peer-to-peer backup systems," in Proc. Int. Conf. Distrib. Comput. Syst., 2009, pp. 376-384.
38. J. Li, S. Yang, X. Wang, and B. Li, "Tree-structured data regeneration in distributed storage systems with regenerating codes," in Proc. IEEE INFOCOM, 2010, DOI: 10.1109/INFCOM. 2010.5462122.
39. T. Dikaliotis, A. G. Dimakis, and T. Ho, "Security in distributed storage systems by communicating a logarithmic number of bits," in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2010, pp. 1948-1952.
40. S. Pawar, S. El Rouayheb, and K. Ramchandran, "On security for distributed storage systems," in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2010.
41. S. Yekhanin, "Locally decodable codes," Found. Trends Theor. Comput. Sci., 2010.
42. C. Huang and L. Xu, "STAR: An efficient coding scheme for correcting triple storage node failures," in Proc. 4th Usenix Conf. File Storage Technol., San Francisco, CA, Dec. 2005.
43. D. Papailiopoulos and A. G. Dimakis, "Interference alignment as a rank constrained rank minimization," in Proc. IEEE Global Telecommun. Conf., 2010, vol. 2, pp. 895-900.
44. D. Papailiopoulos and A. G. Dimakis, "Connecting distributed storage codes and secure degrees-of-freedom of multiple access channels," in Proc. Allerton Conf. Control Comput. Commun., 2010.
45. V. Cadambe, S. Jafar, and H. Maleki, "Distributed data storage with minimum storage regenerating codesVExact and functional repair are asymptotically equally efficient," in Proc. IEEE Int. Workshop Wireless Netw. Coding, Apr. 2010. [Online]. Available: http://arxiv.org/abs/1004.4299.
46. K. 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. Inf. Theory. [Online]. Available: http://arxiv.org/abs/1005.4178.