{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:25:33Z","timestamp":1762507533660,"version":"3.37.3"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OAC-1724845","CNS-1733596","ACI-1661378"],"award-info":[{"award-number":["OAC-1724845","CNS-1733596","ACI-1661378"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Microsoft Research Faculty Fellowship","award":["8300751"],"award-info":[{"award-number":["8300751"]}]},{"name":"IBM Ph.D. fellowship","award":["2017"],"award-info":[{"award-number":["2017"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2019,10,1]]},"DOI":"10.1109\/tpds.2018.2873384","type":"journal-article","created":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T18:25:42Z","timestamp":1538418342000},"page":"2355-2369","source":"Crossref","is-referenced-by-count":24,"title":["Popularity-Aware Multi-Failure Resilient and Cost-Effective Replication for High Data Durability in Cloud Storage"],"prefix":"10.1109","volume":"30","author":[{"given":"Jinwei","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7681-6255","authenticated-orcid":false,"given":"Haiying","family":"Shen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0788-6265","authenticated-orcid":false,"given":"Husnu S.","family":"Narman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"257","article-title":"Migratory compression: Coarse-grained data reordering to improve compressibility","author":"lin","year":"2014","journal-title":"Proc USENIX Conf File Storage Technol"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848172"},{"key":"ref33","first-page":"281","article-title":"TAPER: Tiered approach for eliminating redundancy in replica synchronization","author":"jain","year":"2005","journal-title":"Proc USENIX Conf File Storage Technol"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1837915.1837921"},{"year":"2016","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1201\/b17336"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2011.24"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35170-9_18"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25821-3_6"},{"key":"ref34","first-page":"26","article-title":"SiLo: A similarity-locality based near-exact deduplication scheme with low RAM overhead and high throughput","author":"xia","year":"2011","journal-title":"Proc USENIX Annu Techn Conf"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807162"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807160"},{"key":"ref29","first-page":"61","article-title":"Availability in globally distributed storage systems","author":"ford","year":"2010","journal-title":"Proc USENIX Conf Operating System Design and Implementations"},{"year":"2016","key":"ref2"},{"year":"2016","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2421648.2421657"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043560"},{"key":"ref21","first-page":"31","article-title":"Tiered replication: A cost-effective alternative to full cluster geo-replication","author":"cidon","year":"2015","journal-title":"Proc USENIX Annu Techn Conf"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2523623"},{"key":"ref25","first-page":"529","article-title":"CubicRing: Enabling one-hop failure detection and recovery for distributed in-memory storage systems","author":"zhang","year":"2015","journal-title":"Proc 3rd USENIX Conf Netw Syst Des Implementation"},{"key":"ref50","article-title":"Reducing failure probability of cloud storage services using multi-clouds","author":"rawat","year":"2013","journal-title":"Comput Res Repository"},{"year":"2016","key":"ref51"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840627"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168845"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742798"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806841"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694370"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465361"},{"key":"ref52","first-page":"7","article-title":"Chain replication for supporting high throughput and availability","author":"renesse","year":"2004","journal-title":"Proc USENIX Conf Operating System Design and Implementations"},{"key":"ref10","first-page":"143","article-title":"Glacier: Highly durable, decentralized storage despite massive correlated failures","author":"haeberlen","year":"2005","journal-title":"Proc 3rd USENIX Conf Netw Syst Des Implementation"},{"key":"ref11","first-page":"37","article-title":"Copysets: Reducing the frequency of data loss in cloud storage","author":"cidon","year":"2013","journal-title":"Proc USENIX Annu Techn Conf"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2016.036"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989438"},{"key":"ref15","first-page":"351","article-title":"Pelican: A building block for exascale cold data storage","author":"balakrishnan","year":"2014","journal-title":"Proc USENIX Conf Operating System Design and Implementations"},{"key":"ref16","article-title":"Popular is cheaper: Curtailing memory costs in interactive analytics engines","author":"ghosh","year":"2018","journal-title":"Proc ACM SIGOPS\/EuroSys Eur Conf Comput Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966472"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592816"},{"year":"2014","author":"a","key":"ref19"},{"key":"ref4","first-page":"4","article-title":"Efficient replica maintenance for distributed storage systems","author":"chun","year":"2006","journal-title":"Proc 3rd USENIX Conf Netw Syst Des Implementation"},{"year":"2016","key":"ref3"},{"key":"ref6","first-page":"16","article-title":"Data availability and durability with the hadoop distributed file system","volume":"37","author":"chansler","year":"2012","journal-title":"USENIX Mag"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"ref8","first-page":"225","article-title":"Subtleties in tolerating correlated failures in wide-area storage systems","author":"nath","year":"2006","journal-title":"Proc 3rd USENIX Conf Netw Syst Des Implementation"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807130"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2385603.2385606"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1352592.1352599"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921201"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"year":"2016","key":"ref48"},{"key":"ref47","first-page":"1","article-title":"How good is random linear coding based distributed networked storage","author":"aceda?ski","year":"2005","journal-title":"Proc Workshop Network Coding Theory Appl"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.1009"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6610(2001)9:1<60::AID-JCD5>3.0.CO;2-W"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2611354.2611372"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806840"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/71\/8830308\/8478382-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/8830308\/08478382.pdf?arnumber=8478382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:23Z","timestamp":1657746863000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8478382\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,1]]},"references-count":58,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2018.2873384","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"type":"print","value":"1045-9219"},{"type":"electronic","value":"1558-2183"},{"type":"electronic","value":"2161-9883"}],"subject":[],"published":{"date-parts":[[2019,10,1]]}}}