Hierarchical Placement Learning for Network Slice Provisioning

Jesutofunmi Ajayi,Antonio Di Maio,Torsten Braun

Published 2025 in IEEE Conference on Local Computer Networks

ABSTRACT

In this work, we aim to address the challenge of slice provisioning in edge-based mobile networks. We propose a solution that learns a service function chain placement policy for Network Slice Requests, to maximize the request acceptance rate, while minimizing the average node resource utilization. To do this, we consider a Hierarchical Multi-Armed Bandit problem and propose a two-level hierarchical bandit solution which aims to learn a scalable placement policy that optimizes the stated objectives in an online manner. Simulations on two real network topologies show that our proposed approach achieves 5% average node resource utilization while admitting over 25% more slice requests in certain scenarios, compared to baseline methods.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-36 of 36 references · Page 1 of 1

CITED BY

  • No citing papers are available for this paper.

Showing 0-0 of 0 citing papers · Page 1 of 1