{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:31:01Z","timestamp":1740148261407,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"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":["CNS-1618335"],"award-info":[{"award-number":["CNS-1618335"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tnsm.2018.2875475","type":"journal-article","created":{"date-parts":[[2018,10,11]],"date-time":"2018-10-11T18:52:20Z","timestamp":1539283940000},"page":"176-191","source":"Crossref","is-referenced-by-count":8,"title":["Tiered Cloud Storage via Two-Stage, Latency-Aware Bidding"],"prefix":"10.1109","volume":"16","author":[{"given":"Yang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0793-7536","authenticated-orcid":false,"given":"Arnob","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9131-4723","authenticated-orcid":false,"given":"Vaneet","family":"Aggarwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(97)87599-0"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/1016053"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_15"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2017.2648785"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2851379"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2017.2658440"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1049\/ip-cdt:19971225","article-title":"pollaczek-khinchin formula for the m\/g\/1 queue in discrete time with vacations","volume":"144","author":"chan","year":"1997","journal-title":"Computers and Digital Techniques IEE Proceedings-"},{"journal-title":"Amazon found every 100ms of latency cost them 1% in sales","year":"2008","author":"shalom","key":"ref36"},{"key":"ref35","article-title":"Tail index for a distributed storage system with Pareto file size distribution","volume":"abs 1607 6044","author":"aggarwal","year":"2016","journal-title":"CoRR"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.810496"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2462307.2462315"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(94)00097-2"},{"journal-title":"Amazon","year":"2017","key":"ref11"},{"journal-title":"DropBox","year":"2017","key":"ref12"},{"journal-title":"Google","year":"2017","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2389952"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218655"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2017.2695123"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2503763"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1257\/aer.104.5.442"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"ref28","first-page":"1","article-title":"Taming tail latency for erasure-coded, distributed storage systems","author":"aggarwal","year":"2017","journal-title":"Proc IEEE Conf Comput Commun INFOCOM"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2668128"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2667522.2667524"},{"key":"ref3","first-page":"20","article-title":"Cost effective storage using extent based dynamic tiering","author":"guerra","year":"2011","journal-title":"Proc USENIX Conf File Storage Technol"},{"key":"ref6","first-page":"229","article-title":"Balancing fairness and efficiency in tiered storage systems with bottleneck-aware allocation","author":"wang","year":"2014","journal-title":"Proc USENIX Conf File Storage Technol"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2749879"},{"key":"ref5","first-page":"6","article-title":"On the importance of evaluating storage systems&#x2019; $costs","author":"li","year":"2014","journal-title":"Proc 2nd USENIX Conf Hot Topics Stor File Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398827"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CloudCom.2011.48"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2466453"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GCE.2008.4738443"},{"journal-title":"Storage Virtualization for Dummies","year":"2009","author":"luca","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043560"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984654"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935196"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2007.10.008"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848013"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9203-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934965"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.207"},{"key":"ref26","first-page":"1","article-title":"Pricing games for hybrid object stores in the cloud: Provider vs. tenant","author":"cheng","year":"2015","journal-title":"USENIX Workshop on Hot Topics in Cloud Computing"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1021\/ie060727h"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745873"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/4275028\/8664201\/8489980-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4275028\/8664201\/08489980.pdf?arnumber=8489980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:45Z","timestamp":1657745565000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8489980\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":45,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2018.2875475","relation":{},"ISSN":["1932-4537","2373-7379"],"issn-type":[{"type":"electronic","value":"1932-4537"},{"type":"electronic","value":"2373-7379"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}