Heuristic for Edge-enabled Network Slicing Optimization using the "Power of Two Choices" - Archive ouverte HAL Access content directly
Conference Papers Year :

Heuristic for Edge-enabled Network Slicing Optimization using the "Power of Two Choices"

(1, 2) , (2) , (3) , (1)
1
2
3
Fabice Guillemin
  • Function : Author
  • PersonId : 1080198
Pierre Sens

Abstract

We propose an online heuristic algorithm for the problem of network slice placement optimization. The solution is adapted to support placement on large scale networks and integrates Edge-specific and URLLC constraints. We rely on an approach called the "Power of Two Choices" to build the heuristic. The evaluation results show the good performance of the heuristic that solves the problem in few seconds under a large scale scenario. The heuristic also improves the acceptance ratio of network slice placement requests when compared against a deterministic online Integer Linear Programming (ILP) solution.
Fichier principal
Vignette du fichier
CNSM2020_camera_ready_wo_copyright.pdf (1.19 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02981120 , version 1 (27-10-2020)

Identifiers

  • HAL Id : hal-02981120 , version 1

Cite

Jose Jurandir Alves Esteves, Amina Boubendir, Fabice Guillemin, Pierre Sens. Heuristic for Edge-enabled Network Slicing Optimization using the "Power of Two Choices". CNSM 2020 - 16th International Conference on Network and Service Management, Nov 2020, Izmir / Virtual, Turkey. ⟨hal-02981120⟩
98 View
264 Download

Share

Gmail Facebook Twitter LinkedIn More