{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T13:07:36Z","timestamp":1772888856151,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Italian National Group for Scientific Computation","award":["(GNCS-INDAM)"],"award-info":[{"award-number":["(GNCS-INDAM)"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/tnet.2017.2783623","type":"journal-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T19:26:02Z","timestamp":1516303562000},"page":"302-313","source":"Crossref","is-referenced-by-count":34,"title":["Cache Policies for Linear Utility Maximization"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8779-0620","authenticated-orcid":false,"given":"Giovanni","family":"Neglia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3467-1166","authenticated-orcid":false,"given":"Damiano","family":"Carra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4675-7677","authenticated-orcid":false,"given":"Pietro","family":"Michiardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658"},{"key":"ref32","author":"shah","year":"2010","journal-title":"An o(1) Algorithm for Implementing the Lfu Cache Eviction Scheme"},{"key":"ref31","author":"granjon","year":"2012","journal-title":"The CUSUM Algorithm a Small Review"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/41.1-2.100"},{"key":"ref36","author":"basseville","year":"1993","journal-title":"Detection of Abrupt Changes Theory and Application"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3124-8","author":"br\u00e9maud","year":"1999","journal-title":"Markov Chains Gibbs Fields Monte Carlo Simulation and Queues"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.6.867"},{"key":"ref10","article-title":"Competitive online algorithms","author":"albers","year":"1996"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0124-5"},{"key":"ref12","first-page":"193","article-title":"Cost-aware www proxy caching algorithms","author":"cao","year":"1997","journal-title":"Proc USENIX USITS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80014-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.801752"},{"key":"ref15","first-page":"8","article-title":"A versatile and accurate approximation for LRU cache performance","author":"fricker","year":"2012","journal-title":"IEEE Proc 24th International Teletraffic Congress"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2896380"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830400625X"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.2307\/2951778"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.171"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524380"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITC-28.2016.127"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524381"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2016.7492918"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524445"},{"key":"ref29","first-page":"1","article-title":"Modeling conservative updates in multi-hash approximate count sketches","author":"bianchi","year":"2012","journal-title":"Proc ITC"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30162-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.03.006"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2541320"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_61"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2433296"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.01.027"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2307\/3214097"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/moor.14.1.70"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/moor.13.2.311"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"ref25","author":"young","year":"2001","journal-title":"Individual Strategy & Social Structure&#x2014;An Evolutionary Theory of Institutions"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8291715\/08263155.pdf?arnumber=8263155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:17:07Z","timestamp":1642004227000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8263155\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":36,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2017.2783623","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}