Network slicing represents a substantial technological advance in 5G mobile network, greatly expanding the variety and manifoldness of network services to be supported. Additionally, 3GPP 5G New Radio (NR) has introduced novel features such as mixed numerology and mini-slots, which can be harnessed by network slicing to cater to the diverse requirements of 5G services. While however the co-existence of multiple network slices leads to a challenging resource allocation problem, these new features also severely complicate the management of radio resources. As a further point of attention, the virtualization of radio functions may exact a significant toll from the, already limited, computing resources at the network edge. It follows that a cost-efficient resource allocation across all the slices becomes crucial. In this paper, we address the above-mentioned issues by modeling a cost-efficient radio resource management in 5G NR featuring network slicing, named CERS, through a Mixed Integer Quadratically constrained Program (MIQCP). We maximize the profit of all slices simultaneously guaranteeing the target data rate and delay specified in the service level agreements (SLAs) fo the different traffic flows. To reduce the complexity of the MIQCP problem, we decompose it into two sub-problems, namely, the scheduling problem of enhanced Mobile Broadband (eMBB) user equipments (UEs) on a time-slot basis and of Ultra-Reliable Low Latency Communications (uRLLC) UEs on a mini-slot basis, while keeping the objective unchanged. To address the scheduling issue of eMBB UEs, we employ a heuristic technique, and, by leveraging the outcome of this heuristic, we derive an optimal solution for the problem of uRLLC UEs. The significance of the proposed approach over a baseline approach is evaluated through extensive numerical simulations in terms of the number of allocated uRLLC resource blocks (RBs) per mini-slot. We also assess our approach by measuring the impact of the uRLLC slice changes on the eMBB slice, and vice versa, including delay for uRLLC users and data rates for eMBB users.

Cost-efficient RAN Slicing for Service Provisioning in 5G/B5G / Pramanik, S.; Ksentini, Adlen; Chiasserini, C. F.. - In: COMPUTER COMMUNICATIONS. - ISSN 0140-3664. - STAMPA. - 222:(2024), pp. 141-149. [10.1016/j.comcom.2024.04.026]

Cost-efficient RAN Slicing for Service Provisioning in 5G/B5G

S. Pramanik;C. F. Chiasserini
2024

Abstract

Network slicing represents a substantial technological advance in 5G mobile network, greatly expanding the variety and manifoldness of network services to be supported. Additionally, 3GPP 5G New Radio (NR) has introduced novel features such as mixed numerology and mini-slots, which can be harnessed by network slicing to cater to the diverse requirements of 5G services. While however the co-existence of multiple network slices leads to a challenging resource allocation problem, these new features also severely complicate the management of radio resources. As a further point of attention, the virtualization of radio functions may exact a significant toll from the, already limited, computing resources at the network edge. It follows that a cost-efficient resource allocation across all the slices becomes crucial. In this paper, we address the above-mentioned issues by modeling a cost-efficient radio resource management in 5G NR featuring network slicing, named CERS, through a Mixed Integer Quadratically constrained Program (MIQCP). We maximize the profit of all slices simultaneously guaranteeing the target data rate and delay specified in the service level agreements (SLAs) fo the different traffic flows. To reduce the complexity of the MIQCP problem, we decompose it into two sub-problems, namely, the scheduling problem of enhanced Mobile Broadband (eMBB) user equipments (UEs) on a time-slot basis and of Ultra-Reliable Low Latency Communications (uRLLC) UEs on a mini-slot basis, while keeping the objective unchanged. To address the scheduling issue of eMBB UEs, we employ a heuristic technique, and, by leveraging the outcome of this heuristic, we derive an optimal solution for the problem of uRLLC UEs. The significance of the proposed approach over a baseline approach is evaluated through extensive numerical simulations in terms of the number of allocated uRLLC resource blocks (RBs) per mini-slot. We also assess our approach by measuring the impact of the uRLLC slice changes on the eMBB slice, and vice versa, including delay for uRLLC users and data rates for eMBB users.
File in questo prodotto:
File Dimensione Formato  
CES_5GNR_PAPER_SOMREETA.pdf

accesso aperto

Tipologia: 1. Preprint / submitted version [pre- review]
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 485.54 kB
Formato Adobe PDF
485.54 kB Adobe PDF Visualizza/Apri
1-s2.0-S0140366424001488-main.pdf

accesso aperto

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Creative commons
Dimensione 729.77 kB
Formato Adobe PDF
729.77 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2987993