Table of Contents
Fetching ...

Prioritizing Latency with Profit: A DRL-Based Admission Control for 5G Network Slices

Proggya Chakraborty, Aaquib Asrar, Jayasree Sengupta, Sipra Das Bit

TL;DR

The work tackles latency-aware admission control for multi-service 5G network slices and profitability using a DRL-based approach. It introduces DePSAC, which adds a delay-aware reward and replaces epsilon-greedy exploration with Boltzmann exploration to stabilize learning. Experimental results on a simulated 5G core substrate show DePSAC delivering higher profits, reduced URLLC delays, better acceptance rates, and more efficient resource utilization than the DSARA baseline. The findings highlight a practical QoS-profit trade-off improvement and indicate potential for broader multi-objective network optimization in slice management, with formulas such as $R = \frac{\sum_i reward(nsl_i)}{maxProfit(SN,T)}$ and $penalty_i = priority_i \times delay_i$ illustrating the reward shaping.

Abstract

5G networks enable diverse services such as eMBB, URLLC, and mMTC through network slicing, necessitating intelligent admission control and resource allocation to meet stringent QoS requirements while maximizing Network Service Provider (NSP) profits. However, existing Deep Reinforcement Learning (DRL) frameworks focus primarily on profit optimization without explicitly accounting for service delay, potentially leading to QoS violations for latency-sensitive slices. Moreover, commonly used epsilon-greedy exploration of DRL often results in unstable convergence and suboptimal policy learning. To address these gaps, we propose DePSAC -- a Delay and Profit-aware Slice Admission Control scheme. Our DRL-based approach incorporates a delay-aware reward function, where penalties due to service delay incentivize the prioritization of latency-critical slices such as URLLC. Additionally, we employ Boltzmann exploration to achieve smoother and faster convergence. We implement and evaluate DePSAC on a simulated 5G core network substrate with realistic Network Slice Request (NSLR) arrival patterns. Experimental results demonstrate that our method outperforms the DSARA baseline in terms of overall profit, reduced URLLC slice delays, improved acceptance rates, and improved resource consumption. These findings validate the effectiveness of the proposed DePSAC in achieving better QoS-profit trade-offs for practical 5G network slicing scenarios.

Prioritizing Latency with Profit: A DRL-Based Admission Control for 5G Network Slices

TL;DR

The work tackles latency-aware admission control for multi-service 5G network slices and profitability using a DRL-based approach. It introduces DePSAC, which adds a delay-aware reward and replaces epsilon-greedy exploration with Boltzmann exploration to stabilize learning. Experimental results on a simulated 5G core substrate show DePSAC delivering higher profits, reduced URLLC delays, better acceptance rates, and more efficient resource utilization than the DSARA baseline. The findings highlight a practical QoS-profit trade-off improvement and indicate potential for broader multi-objective network optimization in slice management, with formulas such as and illustrating the reward shaping.

Abstract

5G networks enable diverse services such as eMBB, URLLC, and mMTC through network slicing, necessitating intelligent admission control and resource allocation to meet stringent QoS requirements while maximizing Network Service Provider (NSP) profits. However, existing Deep Reinforcement Learning (DRL) frameworks focus primarily on profit optimization without explicitly accounting for service delay, potentially leading to QoS violations for latency-sensitive slices. Moreover, commonly used epsilon-greedy exploration of DRL often results in unstable convergence and suboptimal policy learning. To address these gaps, we propose DePSAC -- a Delay and Profit-aware Slice Admission Control scheme. Our DRL-based approach incorporates a delay-aware reward function, where penalties due to service delay incentivize the prioritization of latency-critical slices such as URLLC. Additionally, we employ Boltzmann exploration to achieve smoother and faster convergence. We implement and evaluate DePSAC on a simulated 5G core network substrate with realistic Network Slice Request (NSLR) arrival patterns. Experimental results demonstrate that our method outperforms the DSARA baseline in terms of overall profit, reduced URLLC slice delays, improved acceptance rates, and improved resource consumption. These findings validate the effectiveness of the proposed DePSAC in achieving better QoS-profit trade-offs for practical 5G network slicing scenarios.

Paper Structure

This paper contains 21 sections, 4 equations, 8 figures, 1 algorithm.

Figures (8)

  • Figure 1: Overall Profit
  • Figure 2: Profit for each use-case
  • Figure 3: Overall Delay
  • Figure 4: Delay across each use-case
  • Figure 5: Overall Acceptance Rate
  • ...and 3 more figures