{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T15:52:32Z","timestamp":1784821952866,"version":"3.55.0"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Berkeley Fellowship"},{"name":"Microsoft Research PhD Fellowship"},{"name":"KFAS Fellowship"},{"name":"AFOSR MURI","award":["FA9550-10-1-0567"],"award-info":[{"award-number":["FA9550-10-1-0567"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1116404"],"award-info":[{"award-number":["CCF-1116404"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1109\/tcomm.2015.2506161","type":"journal-article","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T19:19:05Z","timestamp":1449602345000},"page":"715-722","source":"Crossref","is-referenced-by-count":98,"title":["When Do Redundant Requests Reduce Latency?"],"prefix":"10.1109","volume":"64","author":[{"given":"Nihar B.","family":"Shah","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kangwook","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050053"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115859"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139164412"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/2.268881"},{"key":"ref34","year":"2015","journal-title":"Specifications for the WD Caviar RE 250\ufffdGB Next Generation Serial ATA Drive (Model WD2500YD)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2289382"},{"key":"ref11","first-page":"265","article-title":"Zoolander: Efficiently meeting very strict, low-latency SLOs","author":"stewart","year":"0","journal-title":"Proc USENIX Int Conf Auton Comput (ICAC)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486014"},{"key":"ref13","first-page":"301","article-title":"The power of choice in data-aware cluster scheduling","author":"venkataraman","year":"0","journal-title":"Proc 9th USENIX Conf Oper Syst Des Implement (OSDI)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874955"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736597"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283046"},{"key":"ref17","first-page":"331","article-title":"A Hitchhiker’s guide to fast and efficient data reconstruction in erasure-coded data centers","author":"rashmi","year":"0","journal-title":"Proc ACM Sigcomm"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2047196.2047201"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483236"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2667522.2667524"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1366919.1366930"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037163"},{"key":"ref3","first-page":"115","article-title":"Improving web availability for clients with MONET","author":"andersen","year":"0","journal-title":"Proc USENIX Netw Syst Des Implementation (NSDI)"},{"key":"ref6","first-page":"17","article-title":"Why let resources idle? Aggressive cloning of jobs with Dolly","author":"ananthanarayanan","year":"0","journal-title":"Proc USENIX HotCloud"},{"key":"ref29","article-title":"Performance modeling for realistic storage devices","author":"shriver","year":"1997"},{"key":"ref5","first-page":"71","article-title":"RPT: Re-architecting loss protection for content-aware networks","author":"han","year":"0","journal-title":"Proc USENIX Netw Syst Des Implementation (NSDI)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390234"},{"key":"ref7","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"0","journal-title":"Proc USENIX Annu Tech Conf (ATC)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/502059.502050"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736597"},{"key":"ref20","first-page":"347","article-title":"Queueing with redundant requests: First exact analysis","author":"gardner","year":"0","journal-title":"Proc ACM SIGMETRICS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-007-0018-8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218426"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874919"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISCCSP.2014.6877805"},{"key":"ref26","article-title":"On the latency of erasure-coded cloud storage systems","author":"kumar","year":"2014"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284026"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/26\/7406792\/7348681-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/7406792\/07348681.pdf?arnumber=7348681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:56:36Z","timestamp":1649444196000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7348681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":34,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2015.2506161","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[2016,2]]}}}