Escalonamento de recursos para redes móveis que utilizam o paradigma de fatiamento da rede

• Autor(a) principal: Lopes, Hudson Henrique de Souza
• Data de Publicação: 2021
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Repositório Institucional da UFG
• dARK ID: ark:/38995/0013000009rcq
• Texto Completo: http://repositorio.bc.ufg.br/tede/handle/tede/11755
• topic: Network slicing; Modelagem matemática; Escalonamento de recurso; Mathematical modeling; Network slicing; Resource allocation; CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::MATEMATICA DA COMPUTACAO

In this dissertation, algorithms are proposed for scaling mobile communication network resources to users with different Quality of Service (QoS) requirements from different network slices. For such a purpose, first we perform mathematical modeling of the probability of packet transmission success per unit of power consumed by the User Equipment (UE). We also use the Gauss-Newton, Levenberg-Marquardt, and Tikhonov regularization methods to accurately estimate the parameters of the sigmoidal utility functions for different Channel Quality Indicators (CQIs). Using the proposed utility functions, we present a algorithm to optimally allocate the Base Station (BS) power, a heuristic based on the foraging behavior of bees. the proposal is compared with other algorithms present in the literature and maintains the same probability of successful packet transmission among UEs while raising the fairness index in the distribution of available resources. The simulations are performed based on a simplified network slicing (NS) scenario for fifth generation mobile networks (5G). Two slices are created for the UEs that use Ultra-reliable and Low Latency Communications (URLLC) and Enhanced Mobile Broadband (eMBB) services. Moreover, taking into account the bandwidth sharing, we also propose a joint power and bandwidth algorithm to satisfy QoS criteria in networks based on the NS paradigm. The results obtained are compared to those obtained by combining the power allocation algorithms and the Round-Robin algorithm for bandwidth allocation, and show that the proposal is especially interesting when throughput maximization is desired.