An Online Multi-dimensional Knapsack Approach for Slice Admission Control
Jesutofunmi Ajayi, Antonio Di Maio, Torsten Braun, Dimitrios Xenakis

TL;DR
This paper introduces an online admission control method for network slices modeled as a multidimensional knapsack problem, improving revenue and resource utilization in shared mobile networks.
Contribution
It proposes reservation-based online policies for slice admission control that outperform traditional greedy approaches in revenue and efficiency.
Findings
Revenues increased by up to 12.9% with the new policies.
Resource consumption was reduced by up to 1.7%.
Performance gains are more significant with higher tenant economic inequality.
Abstract
Network Slicing has emerged as a powerful technique to enable cost-effective, multi-tenant communications and services over a shared physical mobile network infrastructure. One major challenge of service provisioning in slice-enabled networks is the uncertainty in the demand for the limited network resources that must be shared among existing slices and potentially new Network Slice Requests. In this paper, we consider admission control of Network Slice Requests in an online setting, with the goal of maximizing the long-term revenue received from admitted requests. We model the Slice Admission Control problem as an Online Multidimensional Knapsack Problem and present two reservation-based policies and their algorithms, which have a competitive performance for Online Multidimensional Knapsack Problems. Through Monte Carlo simulations, we evaluate the performance of our online admission…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
