{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T12:20:59Z","timestamp":1752668459572,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/infocom.2018.8485891","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T14:45:36Z","timestamp":1539873936000},"page":"459-467","source":"Crossref","is-referenced-by-count":7,"title":["LRU Caching with Dependent Competing Requests"],"prefix":"10.1109","author":[{"given":"Guocong","family":"Quan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiyi","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1282924064"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20098"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.07.029"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/3215222"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80014-7"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90177-C"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF02213737"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721434"},{"key":"ref10","volume":"973","author":"coffman","year":"1973","journal-title":"Operating Systems Theory"},{"journal-title":"Spark","year":"0","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674682"},{"key":"ref13","volume":"38","author":"aven","year":"1987","journal-title":"Stochastic analysis of computer storage Springer Science & Business Media"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676176"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009115"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.801752"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0761"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2012.05.008"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2796314.2745850"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0167-6377(99)00037-1","article-title":"Performance of the move-to-front algorithm with Markov-modulated request sequences","volume":"25","author":"coffman","year":"1999","journal-title":"Operations Research Letters"},{"journal-title":"Redis","year":"0","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3219617.3219628"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2014.07.002"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0801-3_5"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/2318857.2254766","article-title":"Workload analysis of a large-scale key-value store","volume":"40","author":"atikoglu","year":"2012","journal-title":"Sigmetrics Performance Evaluation Review"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(01)00045-1"},{"journal-title":"Modern Operating Systems","year":"2001","author":"tanenbaum","key":"ref7"},{"journal-title":"Voldemort","year":"0","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2896380"},{"key":"ref1","first-page":"385","article-title":"Scaling memcache at Facebook","author":"nishtala","year":"2013","journal-title":"Presented as part of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 13)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1029962750"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITC.2013.6662936"},{"key":"ref21","article-title":"Least-recently-used caching with Zipf's law requests","author":"jelenkovi?","year":"2002","journal-title":"Sixth INFORMS Telecommunications Conference"},{"key":"ref24","first-page":"8: 1","article-title":"A versatile and accurate approximation for LRU cache performance","author":"fricker","year":"2012","journal-title":"Proceedings of the 24th International Teletraffic Congress ser lTC ’ 12"},{"key":"ref23","first-page":"21","article-title":"Write skew and Zipf distribution: Evidence and implications","volume":"12","author":"yang","year":"2018","journal-title":"ACM Transactions on Storage (TOS)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972979.6"},{"journal-title":"Approximation of LRU caches miss rate Application to power-law popularities","year":"0","author":"berthet","key":"ref25"}],"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\/08485891.pdf?arnumber=8485891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:24:57Z","timestamp":1598228697000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8485891\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/infocom.2018.8485891","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}