| Literature DB >> 36015827 |
Douglas Chagas da Silva1,2, José Olimpio Rodrigues Batista1, Marco Antonio Firmino de Sousa1,2, Gustavo Marques Mostaço1, Claudio de Castro Monteiro3, Graça Bressan1, Carlos Eduardo Cugnasca1, Regina Melo Silveira1.
Abstract
The Network Slice Selection Function (NSSF) in heterogeneous technology environments is a complex problem, which still does not have a fully acceptable solution. Thus, the implementation of new network selection strategies represents an important issue in development, mainly due to the growing demand for applications and scenarios involving 5G and future networks. This work presents an integrated solution for the NSSF problem, called the Network Slice Selection Function Decision-Aid Framework (NSSF DAF), which consists of a distributed solution in which a part is executed on the user's equipment (for example, smartphones, Unmanned Aerial Vehicles, IoT brokers) functioning as a transparent service, and another at the Edge of the operator or service provider. It requires a low consumption of computing resources from mobile devices and offers complete independence from the network operator. For this purpose, protocols and software tools are used to classify slices, employing the following four multicriteria methods to aid decision making: VIKOR (Visekriterijumska Optimizacija i Kompromisno Resenje), COPRAS (Complex Proportional Assessment), TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) and Promethee II (Preference Ranking Organization Method for Enrichment Evaluations). The general objective is to verify the similarity among these methods and applications to the slice classification and selection process, considering a specific scenario in the framework. It also uses machine learning through the K-means clustering algorithm, adopting a hybrid solution in the implementation and operation of the NSSF service in multi-domain slicing environments of heterogeneous mobile networks. Testbeds were conducted to validate the proposed framework, mapping the adequate quality of service requirements. The results indicate a real possibility of offering a complete solution to the NSSF problem that can be implemented in Edge, in Core, or even in the 5G Radio Base Station itself, without the incremental computational cost of the end user's equipment, allowing for an adequate quality of experience.Entities:
Keywords: 5G; Network Slice Selection Function (NSSF); beyond 5G; multi-criteria decision methods; networks softwarization
Mesh:
Year: 2022 PMID: 36015827 PMCID: PMC9412514 DOI: 10.3390/s22166066
Source DB: PubMed Journal: Sensors (Basel) ISSN: 1424-8220 Impact factor: 3.847
Figure 15G vs. 6G Network Requirements. Based on [12].
Summary of Related Work.
| Work | Contribution | Limitations | Future Works |
|---|---|---|---|
| Rivera et al. (2019) [ | Traffic control rules can be deployed using minimal resources without influencing the efficiency of the Data Plane slices. A management system is necessary for the provision, updating, and control of the physical layer of VNFs that comprise the slices. | Lack of real world implementation | The inclusion of a monitoring agent that can oversee the status of SPGW-U traffic in real-time |
| Bojkovic, Bakmaz and Bakmaz (2019) [ | SD-TOPSIS presents better performance in rank reversibility, but E-TOPSIS has significantly lower complexity operations. The E-TOPSIS method is suggested, especially when dealing with the fine granularity of slices. TOPSIS is considered a good decision-making tool, considering its algorithmic logic and mathematical form. Yet, it fails to provide consistent results due to the rank reversal phenomenon. | Lack of real world implementation | To analyze the influence of various alternative normalization techniques and ranking methods on NSSF performance |
| Bakmaz, Bojkovic and Bakmaz (2020) [ | Alternative techniques, such as linear normalization (MAX-MIN), the weighting of variance, and binary classification alternatives, can reduce both the classification reversibility and computational complexity. This justifies the need to consider Multiple-Criteria Decision-Making (MCDM) methods as a potential solution to the network slice selection problem.Lack of real world implementation To analyze the performance of other MCDM algorithms in terms of ranking reversibility. | Lack of real world implementation | To analyze the performance of other MCDM algorithms in terms of ranking reversibility |
| Shurman, Rawashdeh and Jaradat (2020) [ | A mechanism that enables user equipment to run multiple sessions on different network servers at the same time to utilize the advantages of their services. | Only a temporary session is allowed | To give users a PURE connection to the networks, with user registration and full capabilities |
| Dimolitsas (2020) [ | A multicriteria decision framework for the optimal selection of Edge Points of Presence (EPoPs) to deploy a network slice. Results indicate the relevance of the proposed two-stage method in meeting the user’s hard and soft requirements, allowing communication between slices and optimal resource allocation from the providers. | High cost of deployment | Implement a distributed PoP selection mechanism, improving service discovery and cross-slice communication |
| Zhao et al. (2020) [ | A Genetic Algorithm that can achieve satisfactory results in the maximization of user’s Satisfaction Degree (SD) in the E2E network slicing problem. This method obtained better access and transmission performance when compared to traditional selection methods based on the Received Signal Strength (RSS) or greedy algorithms. | Lack of real world implementation | It is reasonable to propose a real world experiment to validate the GA algorithm simulation results |
| Otoshi et al. (2021) [ | A dynamic slice selection technique that learns to recognize the rough situation and the mapping between current situation and the future slice. The Bayesian Attractor Model (BAM) is used to achieve consistent recognition, as well as the Dirichlet Process Mixture Model (DPMM) to achieve automatic attractor construction. Situations mapping is also automatically learned by using feedback. | Problems such as the bit rate drop should be predicted in advance and the slices should be switched in advance | To incorporate the control lag in the slice selection prediction mechanism |
| Silva et al. (2022) [ | The use of hybrid machine learning algorithms and MCDM methods as a solution for the 5G network slice selection in IoT scenarios. The proposed solution proved to be efficient and the adopted MCDM methods show a similar performance. | Restrictions of the test environment | New experiments considering different scenarios and further development of the proposed algorithms |
Figure 2Edge computing and Fog computing interaction with some applications. Based on [46].
Figure 3Proposed NSSF DAF: Network Slice Selection Function Decision-Aid Framework.
Figure 4NSSF DAF Structure specification.
Figure 5NSSF DAF Integration overview.
Specification of injected traffic during 5 min for each collection.
| Collection | UE 1 (Mbps) | UE 2 (Mbps) | UE 3 (Mbps) | UE 4 (Mbps) | UE 5 (Mbps) |
|---|---|---|---|---|---|
| 01 | 20 | 47 | 07 | 09 | 06 |
| 02 | 22 | 45 | 06 | 12 | 08 |
| 03 | 24 | 49 | 09 | 10 | 06 |
| 04 | 32 | 55 | 14 | 18 | 12 |
| 05 | 25 | 50 | 10 | 05 | 02 |
| 06 | 45 | 70 | 30 | 05 | 03 |
| 07 | 12 | 25 | 05 | 20 | 30 |
| 08 | 20 | 22 | 24 | 02 | 07 |
| 09 | 08 | 28 | 05 | 10 | 03 |
| 10 | 32 | 62 | 22 | 15 | 08 |
| 11 | 10 | 15 | 05 | 02 | 15 |
Figure 6Illustration of the simulation environment architecture for producing network traffic.
Technical specification for slices composition. Based on [82,83].
| Slice 1 | Type | E2E Latency (ms) | Reliability (%) | Data Rate (Mbps) |
|---|---|---|---|---|
| 1 (VN N1 → N4) | Remote | 5 (maximum) | 99.999 (minimum) | DL: 1 (minimum) |
| Driving | UL: 25 (minimum) | |||
| 2 (VN N2 → N5) | Rural | Not specific | Higher than 80% | DL: 50 |
| Macro | UL: 25 | |||
| 3 (VN N3 → N6) | Wireless Road-Side | 30 (max.) | 99.999 | 10 |
| Infrastructure | ||||
| Backhaual (ITS) |
1 VN: Virtual Network; DL: Downlink; UL: Uplink.
Figure 7Overview of normalized dataset.
Figure 8Downward Mean Square Error for K = 1 to K = 8.
Figure 9Unique characterization of the groups, found in the process for Slice 1.
Figure 10Unique characterization of the groups, found in the process for Slice 2.
Figure 11Unique characterization of the groups, found in the process for Slice 3.
Weights Setup.
| Test | Weights 1 |
|---|---|
| 1 | [0.3 0.2 0.1 0.09 0.03 0.03 0.25] |
| 2 | [0.3 0.4 0.15 0.05 0.05 0.02 0.03] |
| 3 | [0.1 0.05 0.15 0.3 0.3 0.08 0.02] |
| 4 | [0.136, 0.144, 0.144, 0.144, 0.144, 0.144, 0.144] |
| 5 | [0.144, 0.236, 0.04, 0.334, 0.165, 0.078, 0.003] |
1 [“Latency”, “Jitter”, “Loss”, “Bandwidth”, “Transfer”, “Distance”, “Reliability”].
VIKOR Method Results.
| Test | Slice 1 (%) | Slice 2 (%) | Slice 3 (%) |
|---|---|---|---|
| 1 | 68.4 | 4.4 | 27.2 |
| 2 | 17.2 | 68.0 | 14.8 |
| 3 | 78.4 | 21.6 | 0.0 |
| 4 | 93.2 | 6.4 | 0.4 |
| 5 | 100.0 | 0.0 | 0.0 |
COPRAS Method Results.
| Test | Slice 1 (%) | Slice 2 (%) | Slice 3 (%) |
|---|---|---|---|
| 1 | 6.0 | 33.6 | 60.4 |
| 2 | 14.0 | 25.6 | 60.4 |
| 3 | 0.0 | 1.6 | 98.4 |
| 4 | 1.2 | 10.4 | 88.4 |
| 5 | 100.0 | 0.0 | 0.0 |
TOPSIS Method Results.
| Test | Slice 1 (%) | Slice 2 (%) | Slice 3 (%) |
|---|---|---|---|
| 1 | 10.8 | 64.8 | 24.4 |
| 2 | 47.2 | 9.2 | 43.6 |
| 3 | 0.0 | 0.8 | 99.2 |
| 4 | 4.8 | 18.4 | 76.8 |
| 5 | 100.0 | 0.0 | 0.0 |
PrometheeII Method Results.
| Test | Slice 1 (%) | Slice 2 (%) | Slice 3 (%) |
|---|---|---|---|
| 1 | 14.4 | 52.4 | 33.2 |
| 2 | 19.2 | 24.0 | 56.8 |
| 3 | 0.0 | 0.4 | 99.6 |
| 4 | 9.2 | 20.0 | 70.8 |
| 5 | 0.8 | 1.2 | 98.0 |
Figure 12VIKOR Method.
Figure 13COPRAS Method.
Figure 14TOPSIS Method.
Figure 15PROMETHEE II Method.
Figure 16Method percentage results for Slice 1.
Figure 17Method percentage results for Slice 2.
Figure 18Method percentage results for Slice 3.