Budget-constrained Edge Service Provisioning with Demand Estimation via Bandit Learning
Not on the map. Why?
Abstract (arXiv)
Shared edge computing platforms, which enable Application Service Providers (ASPs) to deploy applications in close proximity to mobile users are providing ultra-low latency and location-awareness to a rich portfolio of services. Though ubiquitous edge service provisioning, i.e., deploying the application at all possible edge sites, is always preferable, it is impractical due to often limited operational budget of ASPs. In this case, an ASP has to cautiously decide where to deploy the edge service and how much budget it is willing to use. A central issue here is that the service demand received by each edge site, which is the key factor of deploying benefit, is unknown to ASPs a priori. What's more complicated is that this demand pattern varies temporally and spatially across geographically distributed edge sites. In this paper, we investigate an edge resource rental problem where the ASP learns service demand patterns for individual edge sites while renting computation resource at these sites to host its applications for edge service provisioning. An online algorithm, called Context-aware Online Edge Resource Rental (COERR), is proposed based on the framework of Contextual Combinatorial Multi-armed Bandit (CC-MAB). COERR observes side-information (context) to learn the demand patterns of edge sites and decides rental decisions (including where to rent the computation resource and how much to rent) to maximize ASP's utility given a limited budget. COERR provides a provable performance achieving sublinear regret compared to an Oracle algorithm that knows exactly the expected service demand of edge sites. Experiments are carried out on a real-world dataset and the results show that COERR significantly outperforms other benchmarks.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 0; 2025: 1.
5 papers.
- 2021Context-Aware Online Client Selection for Hierarchical Federated Learningcited by 20
- 2021Robust Bandit Learning with Imperfect Contextcited by 8
- 2022Digital Twin-Empowered Network Planning for Multi-Tier Computingcited by 4
- 2023On the Regret of Online Edge Service Hostingcited by 1
- 2025Service Placement in Small Cell Networks Using Distributed Best Arm Identification in Linear Banditscited by 0
- 2025Service Placement in Small Cell Networks Using Distributed Best Arm Identification in Linear Bandits22 Jun 2025
- 2023On the Regret of Online Edge Service Hosting13 Mar 2023
- 2022Digital Twin-Empowered Network Planning for Multi-Tier Computing6 Oct 2022
- 2021Context-Aware Online Client Selection for Hierarchical Federated Learning2 Dec 2021
- 2021Robust Bandit Learning with Imperfect Context9 Feb 2021