An Online Multi-dimensional Knapsack Approach for Slice Admission Control

Ajayi, Jesutofunmi; Di Maio, Antonio; Braun, Torsten; Xenakis, Dimitrios (17 March 2023). An Online Multi-dimensional Knapsack Approach for Slice Admission Control. In: 20th Consumer Communications & Networking Conference (CCNC 2023) (pp. 152-157). IEEE Xplore: IEEE 10.1109/CCNC51644.2023.10060460

[img] Text
An_Online_Multi-dimensional_Knapsack_Approach_for_Slice_Admission_Control.pdf - Published Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (473kB) | Request a copy

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 control method in terms of average revenue gained by the Infrastructure Provider, system resource utilization, and the ratio of accepted slice requests. We compare our approach with those of the online First Come First Serve greedy policy. The simulation's results prove that our proposed online policies increase revenues for Infrastructure Providers by up to 12.9 % while reducing the average resource consumption by up to 1.7%. In particular, when the tenants' economic inequality increases, an Infrastructure Provider who adopts our proposed online admission policies gains higher revenues compared to an Infrastructure Provider who adopts First Come First Serve.

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF) > Communication and Distributed Systems (CDS)
08 Faculty of Science > Institute of Computer Science (INF)

UniBE Contributor:

Ajayi, Jesutofunmi Ademiposi, Di Maio, Antonio, Braun, Torsten, Xenakis, Dimitrios

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics
500 Science

ISSN:

2331-9860

ISBN:

978-1-6654-9734-3

Publisher:

IEEE

Language:

English

Submitter:

Dimitrios Xenakis

Date Deposited:

21 Mar 2023 09:42

Last Modified:

28 Aug 2023 01:38

Publisher DOI:

10.1109/CCNC51644.2023.10060460

Uncontrolled Keywords:

Network Slicing; Admission Control; Online Algorithms; Mobile Networks

BORIS DOI:

10.48350/180379

URI:

https://boris.unibe.ch/id/eprint/180379

Actions (login required)

Edit item Edit item
Provide Feedback