Abstract

The inflexibility and rigidity of the current networking systems in light of the growing number of computing devices that connected to the Internet has led to the need of a new generation of computer networks. In this context, software-defined network has recently emerged as one of the most recognisable solutions to facilitate the network management and decrease the complexity through detaching the control layer from network appliances. Since, each new technology accompanied with new issues and concerns, one of the main challenges that facing the SDNs is the fault tolerance and resilience. Although there are a numerous of studies that have discussed this issue, the after failure repair scenario is remained unclear and have not addressed well yet. For this reason, we specify this paper as a step forward to address the issue of routing changes, which is important for utilising the optimal paths after failure repair. We produced a new network model as well as a compatible framework with SDN architecture to fulfil the routing changes activity. The consequence is estimated based on an analytical model and finally, a case study example is provided in order to conceptualise the concept. Document type: Part of book or chapter of book

Abstract

In order to meet a tremendous amount of data storage requirement in next-generation wireless networks, an increasing number of cloud data centers has been deployed around the world. The underlying core networks are expected to provide the ability to store data in a dynamic and scalable computing environment. The traditional Internet Protocol (IP) has shown to be restricted due to its static architecture, which accordingly motivates the development of Software-Defined Networks (SDNs). In the SDNs, Traffic Engineering (TE) is simpler and programmable with a controller without the requirement of reconfiguration for all network devices. However, the existing TE algorithm of the SDNs rejects a number of requested flows caused by their undetermined routing paths where only flow bandwidth is considered in path determination. This paper proposes a Quality-of-Service (QoS) based Flow Assignment algorithm which enables the computation of end-to-end path for traffic flows guaranteeing the QoS requirements including bandwidth, end-to-end delay and packet loss probability. Through the Open Source Hybrid IP/SDNs platform, the proposed algorithm is validated and shown to significantly reduce flow rejection rate of up to 50% compared to the conventional approach, and therefore can be used to implement an effective DiffServ mechanism for flow allocation in the SDNs. Document type: Part of book or chapter of book

Abstract

Software-defined networking (SDN) is a cornerstone of next-generation networks and has already led to numerous advantages for data-center networks and wide-area networks, for instance in terms of reduced management complexity and more fine-grained traffic engineering. However, the design and implementation of SDN within wireless sensor networks (WSN) have received far less attention. Unfortunately, because of the multi-hop type of communication in WSN, a direct reuse of the wired SDN architecture could lead to excessive commu- nication overhead. In this paper, we propose a cluster-based flow management approach that makes a trade-off between the granularity of monitoring by an SDN controller and the communication overhead of flow management. A network is partitioned into clusters with a minimum number of border nodes. Instead of having to handle the individual flows of all nodes, the SDN controller only manages incoming and outgoing traffic flows of clusters through border nodes. Our proof-of- concept implementations in software and hardware show that, when compared with benchmark solutions, our approach is significantly more efficient with respect to the number of nodes that must be managed and the number of control messages exchanged.

Abstract

[EN] Increasing power consumption and CO2 emissions generated by large data networks have become a major concern over the last decade. For this problem, the emerging paradigm of Software-Defined Networks (SDN) can be seen as an attractive solution. In these networks an energy-aware routing model could be easily implemented leveraging the control and data plane separation. This paper investigates the impact of energy-aware routing on SDN performance. To that end, we propose a novel energy- aware mechanism that reduces the number of active links in SDN with multiple controllers, considering in-band control traffic, i.e. links are shared between data and control plane traffic. The proposed strategy exploits knowledge of the network topology combined with traffic engineering techniques to reduce the overall power consumption. Therefore, two heuristic algorithms are designed: a static network configuration and a dynamic energy-aware routing. Significant values of switched-off links are reached in the simulations using real topologies and demands data. Moreover, obtained results confirm that crucial network parameters such as control traffic delay, data path latency, link utilization and TCAM occupation are affected by the performance-agnostic energy-aware model. This work has been supported by the Ministerio de Econom´ıa y Competitividad of the Spanish Government under project TEC2016-76795-C6-1-R and AEI/FEDER, UE and through a predoctoral FPI scholarship. Fernández-Fernández, A.; Cervelló-Pastor, C.; Ochoa-Aday, L. (2018). Evaluating the Impact of Energy-Aware Routing on Software-Defined Networking Performance. En XIII Jornadas de Ingeniería telemática (JITEL 2017). Libro de actas. Editorial Universitat Politècnica de València. 241-248. https://doi.org/10.4995/JITEL2017.2017.6489 OCS 241 248

Abstract

[ANGLÈS]Lately, the emerging paradigm of Software-Defined Networking has grown in presence and claims to simplify future networking. The decoupling of network control and forwarding plane proposed by this architecture allows the control of the entire network behavior by means of a logically centralized software program (controller). Such separation of planes opens the way to Network Virtualization, which provides users a logical abstraction of underlying network resources. However, network virtualization requires a mapping phase of the virtual resources over the physical resources, which is not trivial, formally known as the virtual network embedding problem. The present document focuses in the development of a variant of one of the proposed strategies to solve this critical step, prioritizing the real-time response. The proposed algorithm uses the properties offered by the Paths Algebra mathematical framework to provide a flexible environment where it is possible to combine any number of both linear and non-linear metrics. In addition, it is also used the multi-lexical ordination, a criterion to better distinguish paths that may be considered equal by other approaches. Such algorithm has been implemented as a software application that provides a simulation environment where the virtual network embedding process can be tested for any given topology. Subsequently, all the algorithm features have been checked in a set of performance tests, focusing on those oriented to the commitment among the real-time response and the quality of the embedding solutions. In general, testing results are very promising even in densely populated backbone topologies, where the number of alternative paths among each possible pair of origin and destination nodes grows exponentially. [CASTELLÀ] Software-Defined Networking (o Redes Definidas por Software) es un nuevo paradigma que tiene como objetivo simplificar la creación y gestión de redes de ordenadores. El desacoplamiento entre el control de la red y el plano de reenvío propuesto por esta arquitectura permite el control de todo el comportamiento de la red mediante un elemento lógico centralizado, llamado controlador. Esta separación de los planos abre la puerta a la virtualización de redes, proporcionando a los usuarios una abstracción lógica de los recursos de red subyacentes. Sin embargo, la virtualización de red requiere de una fase de asignación de los recursos virtuales a los recursos físicos, que no es trivial y que se conoce formalmente como el problema de incrustación de redes virtuales. El presente documento se centra en el desarrollo de una variante de una de las estrategias propuestas para resolver este paso crítico, dando prioridad a la respuesta en tiempo real. El algoritmo propuesto utiliza las propiedades ofrecidas por el marco matemático de Paths Algebra (o Álgebra de Caminos) para proporcionar un entorno flexible donde es posible combinar cualquier número de métricas lineales y no lineales. Además, también utiliza la ordenación multi-léxica, un criterio para distinguir mejor aquellos caminos que podrían ser considerados equivalentes por otros enfoques. Este algoritmo se ha implementado como una aplicación de software que proporciona un entorno de simulación en el que se puede probar el proceso de incrustación de redes virtuales para cualquier topología. Posteriormente, se han comprobado todas las características del algoritmo mediante un conjunto de pruebas de rendimiento, priorizando aquellas orientadas al compromiso entre la respuesta en tiempo real y la calidad de las soluciones de incrustación. En general, los resultados de las pruebas son muy prometedores incluso en topologías de redes troncales densamente pobladas, donde el número de caminos alternativos entre cada posible nodo origen y destino crece exponencialmente.

Abstract

SDN approaches to inter-domain routing promise better traffic engineering, enhanced security, and higher automation. Yet, naïve deployment of SDN on the Internet is dangerous as the control plane expressiveness of BGP is significantly more limited than the data plane expressiveness of SDN, which allows fine-grained rules to deflect traffic from BGP’s default routes. Most notably, this mismatch may lead to incorrect forwarding behaviors such as forwarding loops and blackholes, ultimately hindering SDN deployment at the inter-domain level. In this work, we make a first step towards verifying the correctness of inter-domain forwarding state with a focus on loop freedom while keeping private the SDN rules, as they comprise confidential routing information. To this end, we design a simple yet powerful primitive that allows two networks to verify whether their SDN rules overlap, i.e. the set of packets matched by these rules is non-empty, without leaking any information about the SDN rules. We propose an efficient implementation of this primitive by using recent advancements in Secure Multi-Party Computation and we then leverage it as the main building block for designing a system that detects Internet-wide forwarding loops among any set of SDN-enabled Internet eXchange Points. Master [120] : ingénieur civil en informatique, Université catholique de Louvain, 2017