Reinforcement Learning-Based Network Slicing Scheme for Optimized UE-QoS in Future Networks

Document Type

Article

Publication Date

1-1-2024

Abstract

An end-to-end (E2E) network slicing (NS) scheme for heterogeneous network (HetNet) is proposed in which the number of slices and instances of various network functions (NFs) are optimized contingent on the number of users (UEs) and their quality of service (QoS) requirements. The objective of the scheme is to empower future generation networks by considering control signaling in the control plane as well as the UE traffic in the user plane of the core network (CN). We formulate a joint UE association, wireless bandwidth allocation, slice formation, slice assignment, virtual network function (VNF) placement, computing resource allocation, link assignment, and link bandwidth allocation (TORCH) problem to minimize the E2E task completion time of all UEs while considering both control signaling and UEs' traffic. Since TORCH is a mixed-integer nonlinear problem, to tackle the problem, we decompose it into two sub-problems: the link assignment problem and the UE association, resource allocation, slice formation, slice assignment, and VNF placement (ASSAIL) problem. The ASSAIL problem comprises both the core network (CN) and radio access network (RAN), and they do not compete for resources, so we decompose it into two sub-problems: the RAN problem and the CN problem. We use Dijkstra's algorithm and a deep Q-learning network (DQN) based reinforcement learning method to iteratively solve the two sub-problems. Simulation results have confirmed the effectiveness of our proposed scheme in tackling the TORCH problem. 1932-4537

Identifier

85186097831 (Scopus)

Publication Title

IEEE Transactions on Network and Service Management

External Full Text Location

https://doi.org/10.1109/TNSM.2024.3368294

e-ISSN

19324537

First Page

3454

Last Page

3464

Issue

3

Volume

21

This document is currently not available here.

Share

COinS