{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:53:37Z","timestamp":1782834817470,"version":"3.54.5"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/infocom.2019.8737363","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:35:56Z","timestamp":1560818156000},"page":"694-702","source":"Crossref","is-referenced-by-count":7,"title":["Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels"],"prefix":"10.1109","author":[{"given":"Guocong","family":"Quan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Atilla","family":"Eryilmaz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3224427"},{"key":"ref31","first-page":"483","article-title":"Adaptsize: Orchestrating the hot object memory cache in a content delivery network","author":"berger","year":"2017","journal-title":"NSDI"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737363"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3219617.3219628"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2984356.2984371"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2318857.2254766"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.11.009"},{"key":"ref14","first-page":"385","article-title":"Scaling Memcache at Facebook","volume":"13","author":"nishtala","year":"2013","journal-title":"NSDI"},{"key":"ref15","article-title":"Fog computing: Focusing on mobile users at the edge","author":"luan","year":"2015","journal-title":"arXiv preprint arXiv 1502 01032"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2685434"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6736753"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218465"},{"key":"ref4","year":"0","journal-title":"Redis"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486316"},{"key":"ref3","year":"0","journal-title":"Memcached"},{"key":"ref6","first-page":"115","article-title":"ARC: A self-tuning, low overhead replacement cache","volume":"3","author":"megiddo","year":"2003","journal-title":"FAST"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901467"},{"key":"ref5","year":"0","journal-title":"Aerospike"},{"key":"ref8","author":"tanenbaum","year":"2001","journal-title":"Modern Operating Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/511399.511340"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"ref9","year":"0","journal-title":"MySql"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80014-7"},{"key":"ref22","first-page":"212","article-title":"LRU caching with moderately heavy request distributions","author":"jelenkovi?","year":"0","journal-title":"2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1029962750"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0761"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485891"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485860"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2796314.2745850"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","location":"Paris, France","start":{"date-parts":[[2019,4,29]]},"end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8732929\/8737365\/08737363.pdf?arnumber=8737363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:15:01Z","timestamp":1657854901000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8737363\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/infocom.2019.8737363","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}