609 research outputs found

    Optimization of Beyond 5G Network Slicing for Smart City Applications

    Get PDF
    Transitioning from the current fifth-generation (5G) wireless technology, the advent of beyond 5G (B5G) signifies a pivotal stride toward sixth generation (6G) communication technology. B5G, at its essence, harnesses end-to-end (E2E) network slicing (NS) technology, enabling the simultaneous accommodation of multiple logical networks with distinct performance requirements on a shared physical infrastructure. At the forefront of this implementation lies the critical process of network slice design, a phase central to the realization of efficient smart city networks. This thesis assumes a key role in the network slicing life cycle, emphasizing the analysis and formulation of optimal procedures for configuring, customizing, and allocating E2E network slices. The focus extends to catering to the unique demands of smart city applications, encompassing critical areas such as emergency response, smart buildings, and video surveillance. By addressing the intricacies of network slice design, the study navigates through the complexities of tailoring slices to meet specific application needs, thereby contributing to the seamless integration of diverse services within the smart city framework. Addressing the core challenge of NS, which involves the allocation of virtual networks on the physical topology with optimal resource allocation, the thesis introduces a dual integer linear programming (ILP) optimization problem. This problem is formulated to jointly minimize the embedding cost and latency. However, given the NP-hard nature of this ILP, finding an efficient alternative becomes a significant hurdle. In response, this thesis introduces a novel heuristic approach the matroid-based modified greedy breadth-first search (MGBFS) algorithm. This pioneering algorithm leverages matroid properties to navigate the process of virtual network embedding and resource allocation. By introducing this novel heuristic approach, the research aims to provide near-optimal solutions, overcoming the computational complexities associated with the dual integer linear programming problem. The proposed MGBFS algorithm not only addresses the connectivity, cost, and latency constraints but also outperforms the benchmark model delivering solutions remarkably close to optimal. This innovative approach represents a substantial advancement in the optimization of smart city applications, promising heightened connectivity, efficiency, and resource utilization within the evolving landscape of B5G-enabled communication technology

    Review of Path Selection Algorithms with Link Quality and Critical Switch Aware for Heterogeneous Traffic in SDN

    Get PDF
    Software Defined Networking (SDN) introduced network management flexibility that eludes traditional network architecture. Nevertheless, the pervasive demand for various cloud computing services with different levels of Quality of Service requirements in our contemporary world made network service provisioning challenging. One of these challenges is path selection (PS) for routing heterogeneous traffic with end-to-end quality of service support specific to each traffic class. The challenge had gotten the research community\u27s attention to the extent that many PSAs were proposed. However, a gap still exists that calls for further study. This paper reviews the existing PSA and the Baseline Shortest Path Algorithms (BSPA) upon which many relevant PSA(s) are built to help identify these gaps. The paper categorizes the PSAs into four, based on their path selection criteria, (1) PSAs that use static or dynamic link quality to guide PSD, (2) PSAs that consider the criticality of switch in terms of an update operation, FlowTable limitation or port capacity to guide PSD, (3) PSAs that consider flow variabilities to guide PSD and (4) The PSAs that use ML optimization in their PSD. We then reviewed and compared the techniques\u27 design in each category against the identified SDN PSA design objectives, solution approach, BSPA, and validation approaches. Finally, the paper recommends directions for further research

    Resilient and Scalable Forwarding for Software-Defined Networks with P4-Programmable Switches

    Get PDF
    Traditional networking devices support only fixed features and limited configurability. Network softwarization leverages programmable software and hardware platforms to remove those limitations. In this context the concept of programmable data planes allows directly to program the packet processing pipeline of networking devices and create custom control plane algorithms. This flexibility enables the design of novel networking mechanisms where the status quo struggles to meet high demands of next-generation networks like 5G, Internet of Things, cloud computing, and industry 4.0. P4 is the most popular technology to implement programmable data planes. However, programmable data planes, and in particular, the P4 technology, emerged only recently. Thus, P4 support for some well-established networking concepts is still lacking and several issues remain unsolved due to the different characteristics of programmable data planes in comparison to traditional networking. The research of this thesis focuses on two open issues of programmable data planes. First, it develops resilient and efficient forwarding mechanisms for the P4 data plane as there are no satisfying state of the art best practices yet. Second, it enables BIER in high-performance P4 data planes. BIER is a novel, scalable, and efficient transport mechanism for IP multicast traffic which has only very limited support of high-performance forwarding platforms yet. The main results of this thesis are published as 8 peer-reviewed and one post-publication peer-reviewed publication. The results cover the development of suitable resilience mechanisms for P4 data planes, the development and implementation of resilient BIER forwarding in P4, and the extensive evaluations of all developed and implemented mechanisms. Furthermore, the results contain a comprehensive P4 literature study. Two more peer-reviewed papers contain additional content that is not directly related to the main results. They implement congestion avoidance mechanisms in P4 and develop a scheduling concept to find cost-optimized load schedules based on day-ahead forecasts

    Link failure testing project on a satellite SDN network using Bidirectional Forwarding Detection

    Get PDF
    This project focuses on implementing a variable grid topology network for simulating an inter-satellite links connection to evaluate link failure detection times in a satellite SoftwareDefined Networking (SDN) using the Bidirectional Forwarding Detection (BFD) protocol (RFC 5880). Today, there is significant growth and deployment of LEO satellite networks, and SDN technology is being successfully used in these LEO satellite constellation networks due to the flexibility that this technology offers in the face of dynamic variation in topology network, limited bandwidth and traffic variations. An important point for the correct operation of these networks is the reliability and stability of the links that interconnect the satellites of the constellation, since this constellation is in permanent motion, orbiting the earth. The work developed in this project is directly related to this topic and the BFD detection protocol has been used to determine the connectivity failures of the test network links. The BFD is a protocol which provides fast forwarding path failure detection times and it is independent from physical media, routing protocols and data protocols. The BFD protocol works in the forwarding plane and is well suited for use with SDN switches. The testbed has been built using the "ContainerNet" Python API to implement the network topology and link interconnection of each satellite node. The satellite switching service is implemented in a docker instance, using OpenVirtualSwitch (OVS) as the internal packet switch of each node. OpenVirtualSwitch is an SDN-compliant programmable switching network device that has support for the BFD protocol. A transmission scenario is built on this switching network. This scenario includes two nodes that work as communication endpoints. The nodes have been configured so that between the endpoints there are two separate alternative paths. In addition to the datapath configuration, the BFD protocol has been configured to monitor the status of each link. A software developed running in all intermediate nodes are able to notify a link failure upstream of the datapath until the end nodes. An then end nodes can switch to another path. The final results must determine which are the BFD parameters to achieve a compromise between the BFD packet signaling period and the bandwidth used to keep the VoIP communication parameters within the acceptable limits in the event of a link failure with a route update

    Machine learning for Quality of Experience in real-time applications

    Get PDF
    L'abstract è presente nell'allegato / the abstract is in the attachmen

    Literature review software defined networking for VoIP, SDN

    Get PDF
    Se realizó un análisis de implementaciones de redes SDN enfocándonos a redes con servicios VoIP. Se identificaron implementaciones con OpenFlow como base, así como implementaciones con enfoques de virtualizacion de servicios SIP. Actualmente, el uso de SDN con VoIP se utiliza para permitir un control de QoS y QoE de manera dinámica, eficaz y con bajo coste de implementación. Por último, se analizaron desarrollos de SDN enfocados a seguridad, CAC (Call Admisión Control) y enfoques a la gestión de recursos.An analysis of implementations of SDN networks was carried out, focusing on networks with VoIP services. Implementations with OpenFlow as a base were identified, as well as implementations with approaches to virtualization of SIP services. Currently the use of SDN with VoIP is used to allow QoS and QoE control in a dynamic, efficient way and with low implementation cost. Finally, SDN developments focused on security, CAC (Call Admission Control) and approaches to resource management were analyzed

    Um arcabouço holístico para a execução de funções virtualizadas de rede : arquitetura, gerenciamento e aplicações

    Get PDF
    Orientador: Elias Procópio Duarte JúniorTese (doutorado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática. Defesa : Curitiba, 16/12/2022Inclui referênciasÁrea de concentração: Ciência da ComputaçãoResumo: O paradigma de Virtualização de Funções de Rede (Network Function Virtualization - NFV) visa desacoplar as funções de rede de hardware dedicado, utilizando tecnologias de virtualização para implementar as funções em software. A arquitetura de referência NFV tem sido amplamente adotada, sendo esta composta por três domínios: Infraestrutura Virtualizada (Virtualized Infrastructure - VI), Gerenciamento e Orquestração de NFV (NFV Management and Orchestration - NFV-MANO), além das próprias Funções Virtualizadas de Rede (Virtualized Network Functions - VNF). Já serviços virtualizados são definidos como composições de funções virtualizadas, organizados através de topologias que estabelecem o fluxo de processamento do tráfego de rede. Apesar do grande potencial do paradigma NFV, ainda existem importantes desafios para garantir que seja amplamente adotado nas infraestruturas modernas de telecomunicação. Esta Tese tem como objetivo principal contribuir para a gerência do ciclo de vida de funções e serviços virtualizados de rede. Neste sentido assume-se a premissa de que é essencial garantir previsibilidade operacional e padronização dos elementos que atuam no domínio de VNF, i.e., das plataformas de execução de VNF e dos Sistemas de Gerenciamento de Elemento (Element Management System - EMS). São propostas na Tese arquiteturas que descrevem um modelo de execução e gerenciamento padronizado tanto para plataformas de execução de VNF, como para o EMS, compatíveis com a arquitetura de referência NFV-MANO. As arquiteturas propostas preveem protocolos, interfaces de comunicação e orientações de integração com demais elementos e sistemas NFV. Ambas as arquiteturas foram implementadas e estão disponíveis como software livre: a plataforma COVEN de execução de VNF e o EMS HoLMES. Resultados de avaliação experimental e estudos de caso são apresentados e discutidos. Também, uma investigação do impacto das arquiteturas propostas em três contextos distintos é então introduzida. Inicialmente, é explorado seu impacto como facilitador para a gerência de NFV. Em seguida, o foco fica no compartilhamento de instâncias de funções e serviços de rede, e na emulação NFV. A Tese apresenta também contribuições no contexto de serviços virtualizados de rede. Em particular, o mapeamento multidomínio consiste na implantação de serviços em infraestruturas de virtualização distribuídas. Assim, foi proposta uma estratégia de mapeamento baseado em heurísticas genéticas, denominada GeSeMa. A estratégia permite que seus operadores definam diferentes critérios de avaliação e otimização em busca de mapeamentos de serviço adequados às suas necessidades específicas. Neste sentido, o GeSeMa representa um avanço do estado da arte, pois outras soluções operam de maneira monolítica, não permitindo que operadores e gerentes de rede personalizem o esquema de otimização adotado (e.g., métricas a serem avaliadas, pesos a serem considerados e restrições de mapeamento relacionadas a cada serviço em particular). A solução foi testada em múltiplos estudos de caso e os resultados demonstram sua aplicabilidade e ?exibilidade ao lidar com diferentes cenários de otimização de mapeamentos multidomínio. Finalmente, outras duas contribuições da Tese relacionadas ao paradigma NFV são apresentadas como apêndices, nos contextos de tolerância a falhas e engenharia de tráfego.Abstract: The Network Function Virtualization (NFV) paradigm aims to decouple network functions from dedicated hardware, employing virtualization technologies to implement functions in software. The NFV reference architecture has been widely adopted. This architecture, in turn, is composed of three domains: Virtualized Infrastructure (VI), NFV Management and Orchestration (NFV-MANO), and Virtualized Network Functions (VNF). Compositions of virtualized functions define virtualized services, organized as topologies through which network trafic is steered. Despite the extraordinary potential of the NFV paradigm, there are still relevant challenges to ensure its wide adoption by modern telecommunication infrastructures. The main objective of this Thesis is to contribute to the life cycle management of virtualized network functions and services. In this context, we consider it essential to guarantee the operational predictability and organization of the elements of the VNF domain, i.e., VNF execution platforms, and the Element Management System (EMS). Thus, this Thesis presents architectures that describe a standardized execution and management model for both VNF execution platforms and EMS. The proposed architectures are compliant with the NFV-MANO reference architecture and provide protocols, communication interfaces, and guidelines for their integration with other NFV elements and systems. Both architectures have been implemented and are available as open-source software: the COVEN VNF execution platform and the HoLMES EMS. Experimental evaluation results and case studies are presented and discussed. An investigation of the impact of the proposed architectures in three di?erent contexts is also introduced. First, we explore the opportunities regarding the proposed architectures as enablers for NFV management. Then, the focus goes to sharing instances of network functions and services and NFV emulation. In addition, the Thesis presents contributions in the context of virtualized network services. Multidomain mapping consists of deploying services on distributed virtualization infrastructures. A mapping strategy based on genetic heuristics, called GeSeMa, was proposed. GeSeMa enables its operators to define multiple optimization criteria for searching candidate service mappings tailored to their specific requirements. The proposed strategy represents a state-of-the-art advance, as other solutions operate in a monolithic manner: they do not allow operators and network managers to customize the adopted evaluation setup (e.g., metrics to be evaluated, weights to be considered, and mapping constraints related to each specific service). We tested GeSeMa in multiple case studies; the results demonstrate its applicability and flexibility in dealing with different multidomain mapping optimization scenarios. Finally, two other contributions related to the NFV paradigm, approaching fault tolerance and trafic engineering, are presented as appendices
    corecore