{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:07:52Z","timestamp":1730268472270,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/infocom.2018.8485894","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T18:45:36Z","timestamp":1539888336000},"page":"432-440","source":"Crossref","is-referenced-by-count":8,"title":["Analyzing Replacement Policies in List-Based Caches with Non-Uniform Access Costs"],"prefix":"10.1109","author":[{"given":"Giuliano","family":"Casale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"CRC Concise Encyclopedia of Mathematics","year":"2003","author":"weisstein","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2012.05.008"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(01)00045-1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2006.320218"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.09.022"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(84)90004-X"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80014-7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0207025"},{"key":"ref12","first-page":"1","article-title":"A versatile and accurate approximation for LRU cache performance","author":"fricker","year":"2012","journal-title":"Proc ITC"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2013.10.004"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1145\/2796314.2745850","article-title":"Transient and steady-state regime of a family of list-based cache replacement algorithms","author":"gast","year":"2015","journal-title":"Proc SIGMETRICS 123&#x2013;136"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITC-28.2016.128"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009115"},{"journal-title":"Inequalities","year":"1952","author":"hardy","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2016.36"},{"journal-title":"Reversibility and Stochastic Networks","year":"1979","author":"kelly","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801414"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208694"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/954339.954341"},{"key":"ref3","article-title":"Stochastic analysis of computer storage","author":"aven","year":"1987","journal-title":"Reidel publishing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2014.07.001"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322195"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2307\/3214811"},{"key":"ref8","volume":"ii","author":"courant","year":"1962","journal-title":"Methods of Mathematical Physics"},{"key":"ref7","first-page":"1305","article-title":"Hierarchical web caching systems: modeling, design and experimental results","volume":"20","author":"che","year":"2002","journal-title":"IEEE JSAC"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935123"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/98457.98525"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/321623.321632"},{"key":"ref20","first-page":"485","article-title":"Analysis of demand paging algorithms","author":"king","year":"1971","journal-title":"IFIP Congress"},{"key":"ref22","first-page":"331","article-title":"Applications of singular perturbation methods in queueing","author":"knessl","year":"1996","journal-title":"Frontiers in Queueing Models and Applications in Science and Engineering"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/12.135560"},{"key":"ref24","article-title":"Accurate learning or fast mixing? Dynamic adaptability of caching algorithms","volume":"abs 1701 2214","author":"li","year":"2017","journal-title":"CoRR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/322307.322321"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITC-28.2016.127"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848145"}],"event":{"name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","start":{"date-parts":[[2018,4,16]]},"location":"Honolulu, HI","end":{"date-parts":[[2018,4,19]]}},"container-title":["IEEE INFOCOM 2018 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8464035\/8485803\/08485894.pdf?arnumber=8485894","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T04:25:00Z","timestamp":1598243100000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8485894\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/infocom.2018.8485894","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}