Data-Driven Adaptive Network Slicing for Multi-Tenant Networks
Navid Reyhanian, Zhi-Quan Luo

TL;DR
This paper introduces a two time-scale, data-driven framework for adaptive network slicing in 5G networks, optimizing resource allocation and tenant utility amid dynamic traffic and channel conditions.
Contribution
It proposes a novel sparse optimization framework with convex approximations and algorithms for long and short time-scale network slice reconfiguration.
Findings
Outperforms existing methods in simulation tests.
Effectively maximizes tenant utility while maintaining resource isolation.
Adapts quickly to traffic and channel variations.
Abstract
Network slicing to support multi-tenancy plays a key role in improving the performance of 5G networks. In this paper, we propose a two time-scale framework for the reservation-based network slicing in the backhaul and Radio Access Network (RAN). In the proposed two time-scale scheme, a subset of network slices is activated via a novel sparse optimization framework in the long time-scale with the goal of maximizing the expected utilities of tenants while in the short time-scale the activated slices are reconfigured according to the time-varying user traffic and channel states. Specifically, using the statistics from users and channels and also considering the expected utility from serving users of a slice and the reconfiguration cost, we formulate a sparse optimization problem to update the configuration of a slice resources such that the maximum isolation of reserved resources is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
