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

TL;DR

This paper introduces an online heuristic algorithm based on the Power of Two Choices for efficient edge-enabled network slicing optimization, supporting large-scale networks with specific constraints, and demonstrating improved acceptance ratios and fast computation.

Contribution

The paper presents a novel heuristic approach for network slice placement that scales to large networks and incorporates edge-specific and URLLC constraints.

Findings

Fast solution times in large-scale scenarios

Higher acceptance ratio compared to ILP solutions

Effective handling of edge-specific constraints

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.