{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:36:39Z","timestamp":1758274599235,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772053","61370059"],"award-info":[{"award-number":["61772053","61370059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fund of the State Key Laboratory of Software Development Environment","award":["SKLSDE-2017ZX-10"],"award-info":[{"award-number":["SKLSDE-2017ZX-10"]}]},{"DOI":"10.13039\/501100013287","name":"Science Challenge Project","doi-asserted-by":"crossref","award":["TZ2017002"],"award-info":[{"award-number":["TZ2017002"]}],"id":[{"id":"10.13039\/501100013287","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2017YFB1010000"],"award-info":[{"award-number":["2017YFB1010000"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2801265","type":"journal-article","created":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T19:20:00Z","timestamp":1517599200000},"page":"13350-13357","source":"Crossref","is-referenced-by-count":6,"title":["A New Adaptive Coding Selection Method for Distributed Storage Systems"],"prefix":"10.1109","volume":"6","author":[{"given":"Bing","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Min","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5149-6542","authenticated-orcid":false,"given":"Wei","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing-Yu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3390\/s110504794"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2016.2528246"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.04.042"},{"key":"ref30","first-page":"1","article-title":"In search of I\/O-optimal recovery from disk failures","author":"khan","year":"2011","journal-title":"Proc USENIX HotStorage"},{"key":"ref10","first-page":"1","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX ATC"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"journal-title":"Facebook's erasure coded hadoop distributed file system (HDFS-RAID)","year":"2017","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496983"},{"key":"ref14","first-page":"81","article-title":"Opening the chrysalis: On the real repair performance of MSR codes","author":"juarez","year":"2016","journal-title":"Proc USENIX FAST"},{"key":"ref15","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 FAST"},{"key":"ref16","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":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626325"},{"key":"ref18","first-page":"1","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"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1811039.1811054"},{"key":"ref28","first-page":"1","article-title":"A tale of two erasure codes in HDFS","author":"xia","year":"2015","journal-title":"Proc USENIX FAST"},{"key":"ref4","first-page":"1","article-title":"Ceph: A scalable, high-performance distributed file system","author":"weil","year":"2006","journal-title":"Proc USENIX OSDI"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref3","first-page":"1","article-title":"Disk failures in the real world: What does an MTTF of 1,000,000 hours mean to you?","author":"schroeder","year":"2007","journal-title":"Proc USENIX FAST"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11558989_21"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.167"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-45748-8_31","article-title":"Erasure coding vs. replication: A quantitative comparison","author":"weatherspoon","year":"2002","journal-title":"Proceedings of the International Workshop on Peer-to-Peer Systems"},{"key":"ref7","first-page":"1","article-title":"Ursa minor: Versatile cluster-based storage","author":"abd-el-malek","year":"2005","journal-title":"Proc USENIX FAST"},{"key":"ref2","first-page":"61","article-title":"Availability in globally distributed storage systems","author":"ford","year":"2010","journal-title":"Proc USENIX OSDI"},{"article-title":"Does erasure coding have a role to play in my data center?","year":"2010","author":"zhang","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033730"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2012.6232371"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2611354.2611370"},{"journal-title":"HiBench Suite The Bigdata Micro Benchmark Suite","year":"2017","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691581"},{"journal-title":"Red Hat Inktank Ceph With Erasure Coding and Cache-Tiering","year":"2017","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08279436.pdf?arnumber=8279436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T06:34:24Z","timestamp":1643178864000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8279436\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2801265","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}