{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T15:57:19Z","timestamp":1784822239297,"version":"3.55.0"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"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":["IEEE Trans. Cloud Comput."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tcc.2025.3538158","type":"journal-article","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T18:42:35Z","timestamp":1738694555000},"page":"459-472","source":"Crossref","is-referenced-by-count":11,"title":["Cache Allocation in Multi-Tenant Edge Computing: An Online Model-Based Reinforcement Learning Approach"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4767-4083","authenticated-orcid":false,"given":"Ayoub","family":"Ben-Ameur","sequence":"first","affiliation":[{"name":"SAMOVAR, Telecom SudParis, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Araldo","sequence":"additional","affiliation":[{"name":"SAMOVAR, Telecom SudParis, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1266-5950","authenticated-orcid":false,"given":"Tijani","family":"Chahed","sequence":"additional","affiliation":[{"name":"SAMOVAR, Telecom SudParis, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4876-0223","authenticated-orcid":false,"given":"Gy\u00f6rgy","family":"D\u00e1n","sequence":"additional","affiliation":[{"name":"Division of Network and Systems Engineering, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3043755"},{"key":"ref2","volume-title":"Internet IP transit provider","year":"2020"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2014.6845153"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342393"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3025945"},{"key":"ref6","volume-title":"Cisco Visual Networking Index: Forecast and Trends, 2017\u20132022 White Paper","year":"2019"},{"key":"ref7","volume-title":"Netflix titus","year":"2018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1800132"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3341105.3374026"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS60910.2024.00068"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2971806"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2793892"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.11.009"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3182022"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874793"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.04.006"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3411043.3412514"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.23919\/WONS54113.2022.9764593"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2019.1800286"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3005745.3005750"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133045"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1555228.1555263"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3187310"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/tnsm.2021.3100460"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45855.2022.9838489"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3156178"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737480"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3152150"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3099731"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2979667"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3244909"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3176289"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.109204"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC55528.2022.9912821"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2018.2844379"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2989307"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"key":"ref38","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton","year":"2018"},{"key":"ref39","first-page":"3061","article-title":"Revisiting fundamentals of experience replay","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Fedus"},{"key":"ref40","volume-title":"Stretched exponential decay function for epsilon greedy algorithm","author":"Natarajan","year":"2020"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3024169"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2017.8269175"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2760186"},{"key":"ref45","first-page":"726","article-title":"Learning to control in metric space with optimal regret","volume-title":"Proc. IEEE Annu. Allerton Conf. Commun.","author":"Yang"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.04.005"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591868"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref49","first-page":"1764","article-title":"Fighting boredom in recommender systems with linear reinforcement learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Warlop"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3366704"},{"key":"ref51","first-page":"III-675","article-title":"Better rates for any adversarial deterministic MDP","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dekel"},{"key":"ref52","first-page":"1875","article-title":"Beyond online balanced descent: An optimal algorithm for smoothed online optimization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Goel"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2425248.2425275"},{"key":"ref54","first-page":"164","article-title":"To discount or not to discount in reinforcement learning: A case study comparing R learning and Q learning","volume-title":"Proc. Mach. Learn.","author":"Cohen"},{"key":"ref55","volume-title":"Amazon cloud front","year":"2022"},{"key":"ref56","volume-title":"Netflix open connect","year":"2023"},{"issue":"1","key":"ref57","article-title":"A quantitative measure of fairness and discrimination","volume":"21","author":"Jain","year":"1984","journal-title":"Eastern Res. Lab., Digit. Equip. Corporation"},{"key":"ref58","volume-title":"Full netflix dataset","year":"2024"},{"key":"ref59","volume-title":"Full Amazon Prime video dataset","year":"2024"},{"key":"ref60","volume-title":"Full apple TV dataset","year":"2024"},{"key":"ref61","volume-title":"Telecom shanghai dataset","year":"2023"},{"key":"ref62","volume-title":"The global internet phenomena report","year":"2023"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2022.3201401"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993306"},{"key":"ref65","article-title":"Convergence of sequences of functions","author":"Walker","year":"2017","journal-title":"Econ. 519: Math. Economists, Univ. Arizona"},{"key":"ref66","article-title":"An elementary proof that Q-learning converges almost surely","author":"Regehr","year":"2021"},{"key":"ref67","first-page":"1","article-title":"Convergence of Q-learning: A simple proof","author":"Melo","year":"2001"},{"key":"ref68","first-page":"310","article-title":"A generalized reinforcement-learning model: Convergence and applications","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Littman"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.21236\/ADA276517"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10303"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.2.390"}],"container-title":["IEEE Transactions on Cloud Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6245519\/11027456\/10870410.pdf?arnumber=10870410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T04:23:19Z","timestamp":1749270199000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10870410\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":71,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcc.2025.3538158","relation":{},"ISSN":["2168-7161","2372-0018"],"issn-type":[{"value":"2168-7161","type":"electronic"},{"value":"2372-0018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}