{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:41:20Z","timestamp":1782834080560,"version":"3.54.5"},"reference-count":47,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"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":[],"published-print":{"date-parts":[[2022,5,2]]},"DOI":"10.1109\/infocom48880.2022.9796704","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T21:18:49Z","timestamp":1655759929000},"page":"1669-1678","source":"Crossref","is-referenced-by-count":21,"title":["Optimal Data Placement for Stripe Merging in Locally Repairable Codes"],"prefix":"10.1109","author":[{"given":"Si","family":"Wu","sequence":"first","affiliation":[{"name":"University of Science and Technology of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingpeng","family":"Du","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick P. C.","family":"Lee","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongkun","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinlong","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2012.32"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/225535.225539"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2016.37"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056998"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_31"},{"key":"ref35","article-title":"Global analytics in the face of bandwidth and regulatory constraints","author":"vulimiri","year":"2015","journal-title":"Proc of USENIX NSDI"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190536"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS51746.2020.00032"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2006.40"},{"key":"ref12","article-title":"Exploiting combined locality for wide-stripe erasure coding in distributed storage","author":"hu","year":"2021","journal-title":"Proc of USENIX FAST"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3149349"},{"key":"ref14","article-title":"Erasure coding in Windows Azure Storage","author":"huang","year":"2012","journal-title":"Proc of USENIX ATC"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2326156"},{"key":"ref16","article-title":"PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy","author":"kadekodi","year":"2020","journal-title":"Proc of USENIX OSDI"},{"key":"ref17","article-title":"Cluster storage systems gotta have HeART: Improving storage efficiency by exploiting disk-reliability heterogeneity","author":"kadekodi","year":"2019","journal-title":"Proc of USENIX FAST"},{"key":"ref18","article-title":"On fault tolerance, locality, and optimality in Locally Repairable Codes","author":"kolosov","year":"2018","journal-title":"Proc of USENIX ATC"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1480439.1480444"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref4","year":"0","journal-title":"The Wonder Shaper 1 4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref3","year":"0","journal-title":"Data Age 2025"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3357223.3362713"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref5","article-title":"ShuffleWatcher: Shuffle-aware scheduling in multi-tenant Mapreduce clusters","author":"ahmad","year":"2014","journal-title":"Proc of USENIX ATC"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1713072.1713075"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486021"},{"key":"ref2","year":"2014","journal-title":"Erasure Coding in Ceph"},{"key":"ref9","article-title":"Availability in globally distributed storage systems","author":"ford","year":"2010","journal-title":"Proc of USENIX OSDI"},{"key":"ref1","year":"2017","journal-title":"Apache Hadoop 2 3 0"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485961"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2678505"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.210"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173947"},{"key":"ref47","article-title":"FastScale: Accelerate RAID scaling by minimizing data migration","author":"zheng","year":"2011","journal-title":"Proc of USENIX FAST"},{"key":"ref21","article-title":"OpenEC: Toward unified and configurable erasure coding management in distributed storage systems","author":"li","year":"2019","journal-title":"Proc of USENIX FAST"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2505722"},{"key":"ref24","article-title":"f4: Facebook’s warm BLOB storage system","author":"muralidhar","year":"2014","journal-title":"Proc of USENIX OSDI"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155417"},{"key":"ref23","article-title":"Convertible Codes: New class of codes for efficient conversion of coded data in distributed storage","author":"maturana","year":"2020","journal-title":"Innovations in Theoretical Computer Science (ITCS)"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00053"},{"key":"ref26","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 of USENIX HotStorage"},{"key":"ref43","article-title":"A tale of two erasure codes in HDFS","author":"xia","year":"2015","journal-title":"Proc of USENIX FAST"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2806342"}],"event":{"name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","location":"London, United Kingdom","start":{"date-parts":[[2022,5,2]]},"end":{"date-parts":[[2022,5,5]]}},"container-title":["IEEE INFOCOM 2022 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9796607\/9796652\/09796704.pdf?arnumber=9796704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T20:01:20Z","timestamp":1657569680000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9796704\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/infocom48880.2022.9796704","relation":{},"subject":[],"published":{"date-parts":[[2022,5,2]]}}}