{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T06:36:53Z","timestamp":1786257413376,"version":"build-2736575974"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"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":[[2022,5,16]]},"DOI":"10.1109\/icc45855.2022.9838489","type":"proceedings-article","created":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T19:37:11Z","timestamp":1660246631000},"page":"859-864","source":"Crossref","is-referenced-by-count":13,"title":["Cache Allocation in Multi-Tenant Edge Computing via online Reinforcement Learning"],"prefix":"10.1109","author":[{"given":"Ayoub","family":"Ben-Ameur","sequence":"first","affiliation":[{"name":"T&#x00E9;l&#x00E9;com SudParis,Institut Polytechnique de Paris"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Araldo","sequence":"additional","affiliation":[{"name":"T&#x00E9;l&#x00E9;com SudParis,Institut Polytechnique de Paris"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tijani","family":"Chahed","sequence":"additional","affiliation":[{"name":"T&#x00E9;l&#x00E9;com SudParis,Institut Polytechnique de Paris"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","article-title":"In-edge ai: Intelligentizing mobile edge computing, caching and communication by federated learning","author":"xiaofei","year":"2019","journal-title":"IEEE Network"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1555228.1555263"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3005745.3005750"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133045"},{"key":"ref14","article-title":"Fast reinforcement learning algorithms for resource allocation in data centers","author":"yuang","year":"2020","journal-title":"IFIP"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2793892"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993306"},{"key":"ref17","article-title":"Algorithms for rl","author":"szepesvari","year":"2010","journal-title":"Synthesis lectures"},{"key":"ref18","article-title":"Revisiting fundamentals of experience replay","author":"fedus","year":"0"},{"key":"ref19","article-title":"Stretched exponential decay function for epsilon greedy algorithm","author":"natarajan","year":"0"},{"key":"ref4","article-title":"White paper","year":"2017","journal-title":"Cisco Visual Networking Index Forecast and Trends"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS54207.2022.9789942"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2979667"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.11.009"},{"key":"ref8","article-title":"Fair cache sharing management for multitenant based mobile edge networks","author":"zheng","year":"2020","journal-title":"MobiArch"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.04.006"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3341105.3374026"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904348"},{"key":"ref9","article-title":"Cache subsidies for an optimal memory for bandwidth tradeoff in the access network","author":"mahdieh","year":"2020","journal-title":"JSAC"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"ref22","article-title":"Fighting boredom in recommender systems with linear reinforcement learning","author":"warlop","year":"2018","journal-title":"Advances in NIPS"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2760186"},{"key":"ref24","article-title":"Better rates for any adversarial deterministic mdp","author":"dekel","year":"2013","journal-title":"ICML"},{"key":"ref23","article-title":"Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization","author":"goel","year":"2019","journal-title":"Advances in NIPS"}],"event":{"name":"ICC 2022 - IEEE International Conference on Communications","location":"Seoul, Korea, Republic of","start":{"date-parts":[[2022,5,16]]},"end":{"date-parts":[[2022,5,20]]}},"container-title":["ICC 2022 - IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9837954\/9838246\/09838489.pdf?arnumber=9838489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T20:05:57Z","timestamp":1663013157000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9838489\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,16]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icc45855.2022.9838489","relation":{},"subject":[],"published":{"date-parts":[[2022,5,16]]}}}