Um método de otimização com parâmetros de desempenho para Cloud Network Slices focado no locatário

• Autor(a) principal: Beraldo, Lucian
• Data de Publicação: 2021
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Repositório Institucional da UFSCAR
• Texto Completo: https://repositorio.ufscar.br/handle/ufscar/14084
• topic: Fatiamento de nuvem; Fatiamento de rede; Programação Inteira Linear Mista; IBM CPLEX; Cloud Network Slicing; Mixed Integer Linear Programming; Heuristic; Optimization; CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO

Cloud Network Slicing (CNS), emerging alongside the 5G mobile network, comprises a paradigm shift in the way networks are provisioned, managed, and operated. Fundamentally, CNS fosters the deployment of a multitude of modern applications, e.g., virtual and augmented reality, 4K video streaming, and autonomous vehicles, which require ultra-low latency, high bandwidth consumption, or both. Slicing promotes the realization of such services through the allocation of computing and network resource bundles, which, as CNS mandates, are isolated from the rest of the network. Typically, such resources are arranged into wide geographical areas (e.g., into multiple countries or even continents), which implies that it is possible to pertain to distinct infrastructure providers. This exacerbates the already challenging problem of maximizing resource allocation efficiency, a feature commonly addressed by CNS architectures. In this respect, we study the optimal assignment of slices to multiple domains. Therefore, we account for slices as a collection of computing and network parts. Given specific resource requirements from slice tenants, and potentially multiple offers per slice part, we model the problem as a Mixed Integer Linear Program (MILP). We further design two heuristic algorithms, in order to mitigate the complexity intricacies that would be perceptible in large problem instances. Our evaluation results, based on a simulation environment aligned with the NECOS architecture, indicate that the MILP approach had a better performance compared to both the heuristics in choosing the cheapest offers with a fair amount of performance parameters in an adequate execution time. Our main contribution stands on the optimization methods based on the split and combine approach inserted in the novel NECOS' CNS architecture.