DRL-based Slice Placement Under Non-Stationary Conditions
Not on the map. Why?
Abstract (arXiv)
We consider online learning for optimal network slice placement under the assumption that slice requests arrive according to a non-stationary Poisson process. We propose a framework based on Deep Reinforcement Learning (DRL) combined with a heuristic to design algorithms. We specifically design two pure-DRL algorithms and two families of hybrid DRL-heuristic algorithms. To validate their performance, we perform extensive simulations in the context of a large-scale operator infrastructure. The evaluation results show that the proposed hybrid DRL-heuristic algorithms require three orders of magnitude of learning episodes less than pure-DRL to achieve convergence. This result indicates that the proposed hybrid DRL-heuristic approach is more reliable than pure-DRL in a real non-stationary network scenario.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 28 references that are in the map. First posted on arXiv 5 Aug 2021.
Builds on
4 of 28 references.
References · 4
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
- 2020Heuristic for Edge-enabled Network Slicing Optimization using the Power of Two Choicescited by 5
- 2021A Heuristically Assisted Deep Reinforcement Learning Approach for Network Slice Placementcited by 4
Built on by
Citing papers per year: 2021: 1.
1 paper.