Abstract

Network slicing is one of the core techniques of the current 5G networks. To accommodate as many network slices as possible with limited hardware resources, service providers need to avoid over-provisioning of resources. In this paper, we first propose a Deep Q-Network (DQN) based network slicing algorithm to maximize the acceptance ratio and ensure prior placement of higher-priority requests for Ultra-Reliable Low-Latency Communication (URLLC) services. Specifically, we model the network slicing as a Markov Decision Process (MDP), where we consider Virtual Network Function (VNF) placements to be the actions of the MDP, and define a reward function based on service priority. For every service request, we use the DQN to choose an MDP action for performing the VNF placement. The placement results in an MDP reward that we can use to train the DQN. Once trained, the DQN approximates the optimal solution of the MDP. Considering the over-provisioning of resources, we then propose a Binary Search Assisted Transfer Learning algorithm (BSATL), in which the available hardware resources are scaled down/up and the knowledge learned from the source task is transferred to the target task in each iteration, to achieve automated and closed-loop optimization for the ever changing infrastructure, a scenario of 6G Event Defined uRLLC (EDuRLLC). Numerical evaluations show that our proposed scheme can significantly improve cost-utility while maintaining the optimal acceptance ratio.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call