mlsanityData to 14 Oct 2026

A Heuristically Assisted Deep Reinforcement Learning Approach for Network Slice Placement

arXiv 2105.06741 ↗First posted 14 May 2021cs.NI cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Network Slice placement with the problem of allocation of resources from a virtualized substrate network is an optimization problem which can be formulated as a multiobjective Integer Linear Programming (ILP) problem. However, to cope with the complexity of such a continuous task and seeking for optimality and automation, the use of Machine Learning (ML) techniques appear as a promising approach. We introduce a hybrid placement solution based on Deep Reinforcement Learning (DRL) and a dedicated optimization heuristic based on the Power of Two Choices principle. The DRL algorithm uses the so-called Asynchronous Advantage Actor Critic (A3C) algorithm for fast learning, and Graph Convolutional Networks (GCN) to automate feature extraction from the physical substrate network. The proposed Heuristically-Assisted DRL (HA-DRL) allows to accelerate the learning process and gain in resource usage when compared against other state-of-the-art approaches as the evaluation results evidence.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 6 of its 42 references that are in the map. First posted on arXiv 14 May 2021.

Builds on

6 of 42 references.

References · 6

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
  3. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
  4. 2017Tracking as Online Decision-Making: Learning a Policy from Streaming Videos with Reinforcement Learningcited by 14
  5. 2015Network Function Virtualization: State-of-the-art and Research Challengescited by 9
  6. 2020Heuristic for Edge-enabled Network Slicing Optimization using the Power of Two Choicescited by 5

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 0; 2023: 0; 2024: 1.

5 papers.