Data-Driven Adaptive Network Slicing for Multi-Tenant Networks

Network slicing to support multi-tenancy plays a key role in improving the performance of 5G and beyond networks. In this paper, we study dynamically slicing network resources in the backhaul and Radio Access Network (RAN) prior to user demand observations across multiple tenants, where each tenant...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE journal of selected topics in signal processing Ročník 16; číslo 1; s. 113 - 128
Hlavní autoři: Reyhanian, Navid, Luo, Zhi-Quan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.01.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Approximation
Approximation algorithms
Costs
Expected utility
Group LASSO
multi-tenant network
Network slicing
Optimization
Quality of service
Reconfiguration
Regularization
Resource management
Signal processing algorithms
upper-bound minimization
Utilities
utility maximization
ISSN:1932-4553, 1941-0484
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Network slicing to support multi-tenancy plays a key role in improving the performance of 5G and beyond networks. In this paper, we study dynamically slicing network resources in the backhaul and Radio Access Network (RAN) prior to user demand observations across multiple tenants, where each tenant owns and operates several slices to provide different services to users. 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 enforced. The formulated optimization problems for long and short time-scales are non-convex and difficult to solve. We use the <inline-formula><tex-math notation="LaTeX">\ell _q</tex-math></inline-formula>-norm, <inline-formula><tex-math notation="LaTeX">0< q< 1</tex-math></inline-formula>, and group LASSO regularizations to iteratively find convex approximations of the optimization problems. We propose a Frank-Wolfe algorithm to iteratively solve approximated problems in long time-scales. To cope with the dynamical nature of traffic variations, we propose a fast, distributed algorithm to solve the approximated optimization problems in short time-scales. Simulation results demonstrate the maximized tenant utilities from slice activation via our approach relative to the optimal solution. Moreover, we compare the maximized tenant utilities by our slice reconfiguration approach against the existing state-of-the-art method based on <inline-formula><tex-math notation="LaTeX">\ell _1</tex-math></inline-formula> regularization.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1932-4553
1941-0484
DOI:10.1109/JSTSP.2021.3127796