{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:41:44Z","timestamp":1761324104836,"version":"3.37.3"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502191","61401169","61502190"],"award-info":[{"award-number":["61502191","61401169","61502190"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003819","name":"Hubei Provincial Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2016CFB226"],"award-info":[{"award-number":["2016CFB226"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001839","name":"University Grants Committee of Hong Kong","doi-asserted-by":"publisher","award":["AoE\/E-02\/08"],"award-info":[{"award-number":["AoE\/E-02\/08"]}],"id":[{"id":"10.13039\/501100001839","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council of Hong Kong","award":["CRF-C7036-15"],"award-info":[{"award-number":["CRF-C7036-15"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/tit.2017.2705092","type":"journal-article","created":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T18:29:07Z","timestamp":1495045747000},"page":"2512-2528","source":"Crossref","is-referenced-by-count":10,"title":["Proxy-Assisted Regenerating Codes With Uncoded Repair for Distributed Storage Systems"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1265-7141","authenticated-orcid":false,"given":"Yuchong","family":"Hu","sequence":"first","affiliation":[]},{"given":"Patrick P. C.","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6505-6177","authenticated-orcid":false,"given":"Kenneth W.","family":"Shum","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8629-4622","authenticated-orcid":false,"given":"Pan","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/TIT.2011.2178588"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1109\/TIT.2011.2173792"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/ALLERTON.2009.5394538"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref31","first-page":"1","article-title":"A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster","author":"rashmi","year":"2013","journal-title":"Proc USENIX HotStorage"},{"key":"ref30","first-page":"81","article-title":"Having your cake and eating it too: Jointly optimal erasure codes for I\/O, storage and network-bandwidth","author":"rashmi","year":"2015","journal-title":"Proc USENIX Conf File Storage Technol (FAST)"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.14778\/2535573.2488339"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/ALLERTON.2010.5707092"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1007\/11558989_21"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1137\/0108018"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/50202.50214"},{"key":"ref27","first-page":"81","article-title":"Opening the chrysalis: On the real repair performance of MSR codes","author":"pamies-juarez","year":"2016","journal-title":"Proc USENIX FAST"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1002\/(SICI)1097-024X(199709)27:9<995::AID-SPE111>3.3.CO;2-Y"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/18.850663"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/1807128.1807165"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TC.2007.70830"},{"year":"2005","journal-title":"Intelligent RAID6 Theory Overview and Implementation","key":"ref22"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TPDS.2014.2326156"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1145\/378993.379239"},{"key":"ref23","first-page":"20","article-title":"Rethinking erasure codes for cloud file systems: Minimizing I\/O for recovery and degraded reads","author":"khan","year":"2012","journal-title":"Proc USENIX FAST"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1017\/CBO9780511814075"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TC.2014.2349518"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1109\/TPDS.2015.2505722"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1109\/JSAC.2010.100217"},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1109\/MSST.2012.6232371"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1145\/2027066.2027071"},{"key":"ref53","first-page":"213","article-title":"A tale of two erasure codes in HDFS","author":"xia","year":"2015","journal-title":"Proc USENIX Conf File Storage Technol (FAST)"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1109\/ISIT.2009.5205898"},{"key":"ref10","first-page":"4","article-title":"Efficient replica maintenance for distributed storage systems","author":"chun","year":"2006","journal-title":"Proc NSDI"},{"key":"ref11","first-page":"1","article-title":"Row-diagonal parity for double disk failure correction","author":"corbett","year":"2004","journal-title":"Proc USENIX FAST"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/ISIT.2012.6283043"},{"year":"0","author":"cullina","article-title":"Searching for minimum storage regenerating codes","key":"ref12"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref14","first-page":"1","article-title":"Availability in globally distributed storage systems","volume":"10","author":"ford","year":"2010","journal-title":"Proc USENIX OSDI"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/945449.945450"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/MASCOT.2008.4770564"},{"key":"ref17","first-page":"21","article-title":"NCCloud: Applying network coding for the storage repair in a cloud-of-clouds","author":"hu","year":"2012","journal-title":"Proc FAST"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/JSAC.2010.100216"},{"key":"ref19","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"0"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/12.364531"},{"key":"ref3","first-page":"25","article-title":"Total recall: System support for automated availability management","author":"bhagwan","year":"2004","journal-title":"Proc NSDI"},{"year":"2010","author":"cadambe","journal-title":"Distributed data storage with minimum storage regenerating codes&#x2014;Exact and functional repair are asymptotically equally efficient","key":"ref6"},{"year":"1995","author":"blomer","article-title":"An XOR-based erasure-resilient coding scheme","key":"ref5"},{"key":"ref8","first-page":"16","article-title":"Data availability and durability with the hadoop distributed file system","volume":"37","author":"chansler","year":"2012","journal-title":"USENIX Assoc Newslett"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/2043556.2043571"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1007\/3-540-45748-8_31"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TC.2013.167"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1109\/GLOCOMW.2010.5700274"},{"key":"ref45","first-page":"19","article-title":"BlueSky: A cloud-backed file system for the enterprise","author":"vrable","year":"2012","journal-title":"Proc USENIX FAST"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1145\/1272996.1273035"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1109\/Allerton.2011.6120327"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1109\/TIT.2011.2105003"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1109\/TIT.2013.2274265"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1145\/1629080.1629084"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1109\/TIT.2012.2227110"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8318403\/07930432.pdf?arnumber=7930432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:21:51Z","timestamp":1642004511000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7930432\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":55,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2705092","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}