Data-Driven Adaptive Network Slicing for Multi-Tenant Networks

You are here

Top Reasons to Join SPS Today!

1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.

Data-Driven Adaptive Network Slicing for Multi-Tenant Networks

Navid Reyhanian; Zhi-Quan Luo

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 q -norm, 0<q<1 , 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 1 regularization.

SPS on Twitter

  • This Wednesday, join the Information Forensics and Security Technical Committee Webinar Series when Dr. Richard Heu…
  • Our Biomedical Imaging and Signal Processing Webinar Series continues on Tuesday, 5 July when Michael Unser present…
  • Join us TODAY at 11:00 AM ET when the Brain Space Initiative Talk Series continues with Dr. Tianming Liu presenting…
  • Our 75th anniversary is approaching in 2023, and we're celebrating with a Special Issue of IEEE Signal Processing M…
  • The SPS Webinar Series continues on Monday, 20 June when Dr. Zhijin Qin presents "Semantic Communications: Principl…

SPS Videos

Signal Processing in Home Assistants


Multimedia Forensics

Careers in Signal Processing             


Under the Radar