{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T11:59:00Z","timestamp":1769860740548,"version":"3.49.0"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"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-1955696"],"award-info":[{"award-number":["CNS-1955696"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CRII-CPS-1850206"],"award-info":[{"award-number":["CRII-CPS-1850206"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-Intel CNS-1719384"],"award-info":[{"award-number":["NSF-Intel CNS-1719384"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ARO W911NF-19-1-0367"],"award-info":[{"award-number":["ARO W911NF-19-1-0367"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ARO W911NF-19-2-0243"],"award-info":[{"award-number":["ARO W911NF-19-2-0243"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1109\/tnet.2021.3105880","type":"journal-article","created":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T20:21:00Z","timestamp":1630009260000},"page":"18-31","source":"Crossref","is-referenced-by-count":17,"title":["Learning to Cache and Caching to Learn: Regret Analysis of Caching Algorithms"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7897-2473","authenticated-orcid":false,"given":"Archana","family":"Bura","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8538-6023","authenticated-orcid":false,"given":"Desik","family":"Rengarajan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7968-5185","authenticated-orcid":false,"given":"Dileep","family":"Kalathil","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5882-6433","authenticated-orcid":false,"given":"Srinivas","family":"Shakkottai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2983-9884","authenticated-orcid":false,"given":"Jean-Francois","family":"Chamberland","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"229","article-title":"Statistics and social network of Youtube videos","author":"cheng","year":"2008","journal-title":"Proc 16th Interntional Workshop Qual Service"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2013.2245991"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728174"},{"key":"ref32","first-page":"115","article-title":"ARC: A self-tuning, low overhead replacement cache","author":"megiddo","year":"2003","journal-title":"Proc FAST"},{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.1117\/12.774903","article-title":"Watch global, cache local: Youtube network traffic at a campus network: Measurements and implications","volume":"6818","author":"zink","year":"2008","journal-title":"Proc SPIE"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848145"},{"key":"ref37","first-page":"122","article-title":"Bounded regret in stochastic multi-armed bandits","author":"bubeck","year":"2013","journal-title":"Proc Conf Learn Theory"},{"key":"ref36","article-title":"Optimal regret analysis of Thompson sampling in stochastic multi-armed bandit problem with multiple plays","author":"komiyama","year":"2015","journal-title":"arXiv 1506 00779"},{"key":"ref35","first-page":"127","article-title":"Thompson sampling for contextual bandits with linear payoffs","author":"agrawal","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-1-4612-0865-5_26","article-title":"Probability inequalities for sums of bounded random variables","author":"hoeffding","year":"1994","journal-title":"Collected Works Wassily Hoeffding"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009115"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50019-X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(01)00045-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461936"},{"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","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2014.07.001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITC-28.2016.128"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2818468"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844984"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737446"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814096"},{"key":"ref4","first-page":"153","article-title":"A hierarchical internet object cache","author":"chankhunthod","year":"1996","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.01.001"},{"key":"ref3","author":"hennessy","year":"2011","journal-title":"Computer Architecture A Quantitative Approach"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626331"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2014.6883600"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2002.1021680"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656888"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3149371"},{"key":"ref9","first-page":"485","article-title":"Analysis of demanding paging algorithms","author":"king-iii","year":"1971","journal-title":"Proc IFIP Congr"},{"key":"ref1","author":"coffman","year":"1973","journal-title":"Operating Systems Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3392143"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844981"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref25","first-page":"99","article-title":"Further optimal regret bounds for Thompson sampling","author":"agrawal","year":"2013","journal-title":"Artificial Intelligence and Statistics"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/90\/9714545\/9523607-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9714545\/09523607.pdf?arnumber=9523607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T00:14:44Z","timestamp":1670372084000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9523607\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":40,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2021.3105880","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2]]}}}