Multi-Objective Provisioning of Network Slices using Deep Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Network Slicing (NS) is crucial for efficiently enabling divergent network applications in next generation networks. Nonetheless, the complex Quality of Service (QoS) requirements and diverse heterogeneity in network services entails high computational time for Network Slice Provisioning (NSP) optimization. The legacy optimization methods are challenging to meet the low latency and high reliability of network applications. To this end, we model the real-time NSP as an Online Network Slice Provisioning (ONSP) problem. Specifically, we formulate the ONSP problem as an online Multi-Objective Integer Programming Optimization (MOIPO) problem. Then, we approximate the solution of the MOIPO problem by applying the Proximal Policy Optimization (PPO) method to the traffic demand prediction. Our simulation results show the effectiveness of the proposed method compared to the state-of-the-art MOIPO solvers with a lower SLA violation rate and network operation cost.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 9 of its 22 references that are in the map. First posted on arXiv 27 Jul 2022.
Builds on
9 of 22 references.
References · 9
- 2017Proximal Policy Optimization Algorithmscited by 14,592
- 2018Attention, Learn to Solve Routing Problems!cited by 648
- 2017Emergence of Locomotion Behaviours in Rich Environmentscited by 159
- 20185G Wireless Network Slicing for eMBB, URLLC, and mMTC: A Communication-Theoretic Viewcited by 17
- 2017Network Slicing to Enable Scalability and Flexibility in 5G Mobile Networkscited by 3
- 2019An Algorithmic Theory of Integer Programmingcited by 2
- 2017Provisioning Low Latency, Resilient Mobile Edge Clouds for 5Gcited by 1
- 2018ONETS: Online Network Slice Broker From Theory to Practicecited by 1
- 2021On the Robustness of Controlled Deep Reinforcement Learning for Slice Placementcited by 1
Built on by
Not cited yet.