Cache Allocation in Multi-Tenant Edge Computing via online Reinforcement Learning
Ayoub Ben-Ameur, Andrea Araldo, Tijani Chahed

TL;DR
This paper presents an online reinforcement learning approach for cache allocation in multi-tenant edge computing environments, optimizing resource distribution without prior knowledge or offline training.
Contribution
It introduces a data-driven, model-free RL method that learns cache partitioning policies directly on the live system, addressing confidentiality and lack of prior models.
Findings
Rapid convergence to theoretical optimum
Effective in diverse scenarios
Outperforms existing methods
Abstract
We consider in this work Edge Computing (EC) in a multi-tenant environment: the resource owner, i.e., the Network Operator (NO), virtualizes the resources and lets third party Service Providers (SPs - tenants) run their services, which can be diverse and with heterogeneous requirements. Due to confidentiality guarantees, the NO cannot observe the nature of the traffic of SPs, which is encrypted. This makes resource allocation decisions challenging, since they must be taken based solely on observed monitoring information. We focus on one specific resource, i.e., cache space, deployed in some edge node, e.g., a base station. We study the decision of the NO about how to partition cache among several SPs in order to minimize the upstream traffic. Our goal is to optimize cache allocation using purely data-driven, model-free Reinforcement Learning (RL). Differently from most applications of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Age of Information Optimization · IoT and Edge/Fog Computing
