{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:53:53Z","timestamp":1771700033232,"version":"3.50.1"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T00:00:00Z","timestamp":1374537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2013,7,23]]},"abstract":"<jats:p>The explosion of the amount of data stored in cloud systems calls for more efficient paradigms for redundancy. While replication is widely used to ensure data availability, erasure correcting codes provide a much better trade-off between storage and availability. Regenerating codes are good candidates for they also offer low repair costs in term of network bandwidth. While they have been proven optimal, they are difficult to understand and parameterize. In this paper we provide an analysis of regenerating codes for practitioners to grasp the various trade-offs. More specifically we make two contributions: (i) we study the impact of the parameters by conducting an analysis at the level of the system, rather than at the level of a single device; (ii) we compare the computational costs of various implementations of codes and highlight the most efficient ones. Our goal is to provide system designers with concrete information to help them choose the best parameters and design for regenerating codes.<\/jats:p>","DOI":"10.1145\/2506164.2506170","type":"journal-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T19:12:41Z","timestamp":1374779561000},"page":"23-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Regenerating codes"],"prefix":"10.1145","volume":"47","author":[{"given":"Steve","family":"Jiekak","sequence":"first","affiliation":[{"name":"Technicolor, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[{"name":"INRIA Rennes - Bretagne, Atlantique, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Le Scouarnec","sequence":"additional","affiliation":[{"name":"Technicolor, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Straub","sequence":"additional","affiliation":[{"name":"Technicolor, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Van Kempen","sequence":"additional","affiliation":[{"name":"Technicolor, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"e_1_2_1_2_1","volume-title":"ISIT","author":"Cadambe V. R.","year":"2011","unstructured":"V. R. Cadambe , S. A. Jafar , C. Huang , and J. Li . Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignement . In ISIT , 2011 . V. R. Cadambe, S. A. Jafar, C. Huang, and J. Li. Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignement. In ISIT, 2011."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.14"},{"key":"e_1_2_1_6_1","volume-title":"Rouayheb and K. Ramchandran. Fractional Repetition Codes for Repair in Distributed Storage Systems. In Allerton Conference","author":"El S.","year":"2010","unstructured":"S. El Rouayheb and K. Ramchandran. Fractional Repetition Codes for Repair in Distributed Storage Systems. In Allerton Conference , 2010 . S. El Rouayheb and K. Ramchandran. Fractional Repetition Codes for Repair in Distributed Storage Systems. In Allerton Conference, 2010."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"e_1_2_1_9_1","volume-title":"FAST","author":"Hu Y.","year":"2012","unstructured":"Y. Hu , H. C. H. Chen , P. P. C. Lee , and Y. Tang . NCCloud: Applying Network Coding for the Storage Repair in a Cloud-of-Clouds . In FAST , 2012 . Y. Hu, H. C. H. Chen, P. P. C. Lee, and Y. Tang. NCCloud: Applying Network Coding for the Storage Repair in a Cloud-of-Clouds. In FAST, 2012."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978919"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"e_1_2_1_12_1","volume-title":"USENIX ATC","author":"Huang C.","year":"2012","unstructured":"C. Huang , H. Simitci , Y. Xu , A. Ogus , B. Calder , P. Gopalan , J. Li , and S. Yekhanin . Erasure Coding in Windows Azure Storage . In USENIX ATC , 2012 . C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin. Erasure Coding in Windows Azure Storage. In USENIX ATC, 2012."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978920"},{"key":"e_1_2_1_14_1","first-page":"1","volume-title":"Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes. ArXiv e-prints","author":"Kermarrec A.","year":"2011","unstructured":"A. Kermarrec , N. Le Scouarnec , and G. Straub . Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes. ArXiv e-prints , pages 1 -- 13 , 2011 . arXiv:1102.0204. A. Kermarrec, N. Le Scouarnec, and G. Straub. Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes. ArXiv e-prints, pages 1--13, 2011. arXiv:1102.0204."},{"key":"e_1_2_1_15_1","volume-title":"FAST","author":"Khan O.","year":"2012","unstructured":"O. Khan , R. Burns , J. Plank , W. Pierce , and C. Huang . Rethinking Erasure Codes for Cloud File Systems: Minimizing I\/O for Recovery and Degraded Reads . In FAST , 2012 . O. Khan, R. Burns, J. Plank, W. Pierce, and C. Huang. Rethinking Erasure Codes for Cloud File Systems: Minimizing I\/O for Recovery and Degraded Reads. In FAST, 2012."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.061611.102271"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283044"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2004.17"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195703"},{"key":"e_1_2_1_21_1","volume-title":"Submitted to ISIT","author":"Prakash N.","year":"2012","unstructured":"N. Prakash , G. M. Kamath , V. Lalitha , and P. V. Kumar . Optimal Linear Codes with a Local-Error-Correction Property . In Submitted to ISIT , 2012 . N. Prakash, G. M. Kamath, V. Lalitha, and P. V. Kumar. Optimal Linear Codes with a Local-Error-Correction Property. In Submitted to ISIT, 2012."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033732"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11558989_21"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057113"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"e_1_2_1_28_1","volume-title":"Replication: A Quantitative Comparison. In IPTPS","author":"Weatherspoon H.","year":"2002","unstructured":"H. Weatherspoon and J. Kubiatowicz . Erasure Coding Vs . Replication: A Quantitative Comparison. In IPTPS , 2002 . H. Weatherspoon and J. Kubiatowicz. Erasure Coding Vs. Replication: A Quantitative Comparison. In IPTPS, 2002."}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2506164.2506170","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2506164.2506170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:43Z","timestamp":1750231723000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2506164.2506170"}},"subtitle":["a system perspective"],"short-title":[],"issued":{"date-parts":[[2013,7,23]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,7,23]]}},"alternative-id":["10.1145\/2506164.2506170"],"URL":"https:\/\/doi.org\/10.1145\/2506164.2506170","relation":{},"ISSN":["0163-5980"],"issn-type":[{"value":"0163-5980","type":"print"}],"subject":[],"published":{"date-parts":[[2013,7,23]]},"assertion":[{"value":"2013-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}