An Efficient Algorithm for Determining the Number of 5G Slices


A lot of new devices, techniques and architectures have been developed for the next generation of wireless networks (5G), which is positioned to address the demands and business contexts of 2020 and beyond. In this way, similar 5G use cases can be served by one 5G slice and dissimilar ones by different slices. This fact may lead to resource costs because similar 5G use cases also have distinctions and one 5G slice should meet all the requirements. What is more, 5G slice maintenance may also bring some resource costs. Therefore, we propose an optimization model to determine the appropriate number of 5G slices: K, aiming at minimizing the total resource costs. In order to solve this problem, a new distance is proposed and a clustering algorithm is developed. According to the data from different organizations, we compare our clustering algorithm with hierarchy clustering algorithms. The experimental results show that our algorithm can outstrip other methods in determining the number of 5G slices.

Data Pre-processing
5G SLICES Optimization Model
Use Case Clustering algorithm
Experimental Resuls
Topics: Algorithms

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In