{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T06:56:59Z","timestamp":1767164219892,"version":"build-2238731810"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Internet Comput."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/mic.2018.043051461","type":"journal-article","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T14:45:18Z","timestamp":1533134718000},"page":"15-26","source":"Crossref","is-referenced-by-count":10,"title":["Relieving Both Storage and Recovery Burdens in Big Data Clusters with R-STAIR Codes"],"prefix":"10.1109","volume":"22","author":[{"given":"Mingqiang","family":"Li","sequence":"first","affiliation":[{"name":"Lenovo Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runhui","family":"Li","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick P. C.","family":"Lee","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Shuffle-aware scheduling in multi-tenant MapReduce clusters","author":"ahmad","year":"0","journal-title":"Proc USENIX ATC"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2010.72"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2658991"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691581"},{"key":"ref4","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":"0","journal-title":"Proc USENIX HotStorage"},{"key":"ref3","article-title":"Erasure coding in Windows Azure storage","author":"huang","year":"0","journal-title":"Proc USENIX ATC"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626325"},{"key":"ref8","article-title":"Having your cake and eating it too: Jointly optimal codes for I\/O, storage and network-bandwidth in distributed storage systems","author":"rashmi","year":"0","journal-title":"Proc USENIX FAST"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref2","article-title":"Erasure coding vs. replication: A quantitative comparison","author":"weatherspoon","year":"0","journal-title":"Proc IPTPS"},{"key":"ref1","article-title":"Availability in globally distributed storage systems","author":"ford","year":"0","journal-title":"Proc USENIX OSDI"},{"key":"ref9","article-title":"f4: Facebook's warm BLOB storage system","author":"muralidhar","year":"0","journal-title":"Proc USENIX OSDI"}],"container-title":["IEEE Internet Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4236\/8424104\/08424107.pdf?arnumber=8424107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T16:03:11Z","timestamp":1651766591000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8424107\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":17,"aliases":["10.1109\/mic.2016.54","10.1109\/mic.2017.265102058"],"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/mic.2018.043051461","relation":{},"ISSN":["1089-7801","1941-0131"],"issn-type":[{"value":"1089-7801","type":"print"},{"value":"1941-0131","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}