Deterministic regenerating codes for distributed storage

45th Annual Allerton Conference on Communication, Control, and Computing 2007

Volumn 1, Issue , 2007, Pages 242-249

  Wu, Yunnan ^a   Dimakis, Alexandres ^b   Ramchandran, Kannan ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; DIGITAL STORAGE; FORWARD ERROR CORRECTION; OPTIMAL SYSTEMS; REDUNDANCY; REPAIR;

CONSTRUCTING CODES; DISTRIBUTED STORAGE; MAXIMUM DISTANCE SEPARABLE CODE; NETWORK BANDWIDTH; OPTIMAL TRADEOFFS; REGENERATING CODES; STORAGE EFFICIENCY; STORAGE SYSTEMS;

CODES (SYMBOLS);

EID: 84940640699     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. 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. ASPLOS, Boston, MA, November 2000.
2. A. G. Dimakis, P. G. Godfrey, M. j. Wainwright, and K. Ramchandran, "Network coding for peer-to-peer storage, " in IEEE Proc. INFOCOM, Anchorage, Alaska, May 2007.
3. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding, " IEEE Trans, on Information Theory, vol. 49, pp. 371-381, February 2003.
4. J. Bang-Jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications. New York: Springer, 2001.
5. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.
6. 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. Inform. Theory, vol. 51, pp. 1973-1982, June 2005.
7. R. Koetter and M. Medard, "An algebraic approach to network coding, " IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.