Abstract

Software-Defined Networking (SDN) has been one of the most discussed areas in computer networking over the last years. The field has raised an extensive amount of research, and led to a transformation of traditional network architectures. The architecture of SDN enables the separation of the control and data planes and centralizes the network intelligence. Today's data center networks are clusters of thousands of machines. The most used routing protocol in Data centers is Equal-Cost Multi-Path Protocol (ECMP) which relies on a per-flow static hashing that is known to cause bandwidth loss because of long term collisions. In this paper, a traffic engineering approach built on the concept of SDN is presented that aims to enhance the least-loaded link routing mechanism with intelligent monitoring capabilities. In this perspective, we introduce Hot and Cold link detection (HCLD) mechanism. Our HCLD permits to dynamically re-route heavy flows from heavily utilized links (Hot links) while attracting more flows to lowly utilized links (Cold links). Comprehensive experimental results show that the devised flow scheduling solution outperforms the widely used ECMP. Results also demonstrate that dynamic monitoring of traffic statistics could be used to better utilize the total available bandwidth of the network in a reactive manner. acceptedVersion

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

demanda de eficiência no gerenciamento das redes aumenta atualmente devido ao rápido desenvolvimento da computação em nuvem e a implantação em grande escala de centros de dados. O controle da infraestrutura deve ser capaz de classificar os diversos tipos de tráfego para aplicações diferentes, e prover o atendimento adequado no menor tempo possível. Porém, devido ao dinamismo da rede, nem sempre podem ser garantidos os requisitos mínimos necessários na Internet. Os mecanismos propostos para a engenharia de tráfego até hoje, são baseados em arquiteturas inflexíveis com a camada de controle e dados fortemente integrados. Isto dificulta um atendimento diferenciado adaptável aos diversos padrões de tráfego das aplicações modernas. Para enfrentar os problemas de flexibilidade das redes tradicionais, as Redes Definidas por Software, apresentam um paradigma inovador que separa as camadas de controle e encaminhamento de pacotes de forma a garantir a utilização eficiente dos recursos disponíveis, e ao mesmo tempo maior flexibilidade de implementação. Este paradigma permite conhecer o estado da rede e a sua topologia em tempo real, o que faz possível a reconfiguração de rotas e alocação de recursos de forma dinâmica. Esta dissertação apresenta um framework para engenharia de tráfego em SDN que utiliza a teoria matemática Network Calculus como ferramenta para subsidiar a caracterização e o policiamento de fluxos de pacotes. Através desta teoria, as decisões de encaminhamento e a distribuição do tráfego são baseadas não só por valores obtidos monitorando a rede, como também por projeções determinísticas que descrevem o comportamento do tráfego. Os resultados obtidos nos experimentos, comprovaram a eficiência no balanceamento de carga da rede em termos de atraso, demonstrando ganhos em termos de vazão do sistema e possibilitando a diminuição da porcentagem de perda de pacotes dos fluxos trafegados. O framework proposto visa contribuir na solução dos desafios relacionados a se estabelecer Engenharia de Tráfego para SDN com a especificação de mecanismos de gerenciamento adaptáveis as mudanças topológicas da rede, as diferentes características dos fluxos e que sejam capazes de distribuir de forma equilibrada o tráfego na rede. The demand for network management efficiency is currently boosted by the rapid development of cloud computing and the large-scale deployment of data centers. Infrastructure control should be able to classify the various types of traffic for different applications, and provide adequate service in the shortest time possible. However, due to the dynamism of the network, the necessary minimum requirements on the Internet can not always be guaranteed. The proposed mechanisms for traffic engineering to date are based on inflexible architectures with the control and data layer strongly integrated. This hinders a differentiated service adaptable to the different traffic patterns of modern applications. To address the flexibility problems of traditional networks, Software Defined Networks presents an innovative paradigm that separates packet control and datapath layers to ensure the ecient use of available resources while providing greater deployment flexibility. This paradigm allows to know the state of the network and its topology in real time, which makes it possible to reconfigure routes and allocate resources dynamically. This work presents a framework for SDN traffic engineering that uses the mathematical theory Network Calculus as a tool to subsidize the characterization and policing of packet flows. Through this theory, routing decisions and traffic distribution are based not only on values obtained by monitoring the network, but also on deterministic projections of traffic behavior. The results obtained in the experiments, proved the efficiency in the load balancing of the network based on flow delay, demonstrating gains in terms of total system throughput and enabling the reduction of the percentage of packet loss of the traffic flows. The framework proposed aims to contribute to the solution of the challenges related to establishing Traffic Engineering for SDN with specification of management mechanisms, adaptables to the topological changes of the network, the different characteristics of the flows and capable of distribute in a balanced way the traffic in the network.

Abstract

Key features of satellite communications such as wide-scale coverage, broadcast/multicast support and high availability, together with significant amounts of new satellite capacity coming online, anticipate new opportunities for satellite communications services as an integral part within upcoming 5G systems. To materialize these opportunities, satellite communications services have to be provisioned and operated in a more flexible, agile and cost-effective manner than done today. In this context, this paper firstly describes the architecture of a satellite ground segment system that builds on the introduction of Software Defined Networking (SDN) and Network Function Virtualization (NFV) technologies and then examines a use case for the realization of End-to-End Traffic Engineering in a combined terrestrial-satellite network used for mobile backhauling. Peer Reviewed Document type: Conference object

Abstract

In the recent years more and more existing services have moved from local execution environments into the cloud. In addition, new cloud-based services are emerging, which are characterized by very stringent delay requirements. This trend puts a stress in the existing monolithic architecture of Data Center Networks (DCN), thus creating the need to evolve them. Traffic Engineering (TE) has long been the way of attacking this problem, but as with DCN, needs to evolve by encompassing new technologies and paradigms. This paper provides a comprehensive analysis of current DCN operational and TE techniques focusing on their limitations. Then, it highlights the benefits of incorporating the Software Defined Networking (SDN) paradigm to address these limitations. Furthermore, it illustrates two methodologies and addresses the scalability aspect of DCN-oriented TE, network and service testing, by presenting a hybrid physical-simulated SDN enabled testbed for TE studies.

Abstract

National audience; This research paper proposes IEEE802.3az incorporated green algorithmic schemes on the software defined networking-based segment routing (SDN-based SR) centralized network. The proposed schemes are the green (i.e. the EAGER and CARE metrics) SDN-based SR networks with and without traffic engineering (TE) tunneling. Green metrics extend the IEEE 802.3az energy saving to the whole network, while tunneling avoids the load sharing mechanism included in the segment routing that is not convenient for energy saving purpose. The findings of emulation revealed that the energy efficiency under the EAGER-tunneling strategy is comparable to the conventional metric with TE tunneling, and the saving realized under the CARE-tunneling scheme is twofold in comparison with the LEGACY-tunneling strategy. Meanwhile, the energy saving performance achieved with all three metrics under TE non-tunneling was inferior to those with tunneling. Nonetheless, the lower end-to-end delay and lower maximum link utilization (MLU) were achievable with the non-tunneling strategy.

Abstract

International audience; Energy consumption has become a limiting factor for deploying large-scale distributed infrastructures. This work 1 seeks to improve the energy efficiency of backbone networks by providing an intra-domain Software Defined Network (SDN) approach to selectively turn off a subset of links. We propose the STREETE framework (SegmenT Routing based Energy Efficient Traffic Engineering) that dynamically adapts the number of powered-on links to the traffic load. The core of the solution relies on SPRING, a novel protocol being standardized by IETF. It is also known under the name of Segment Routing. The algorithms have been implemented and evaluated using the OMNET++ simulator. Experimental results show that the consumption of 44% of links can be reduced while preserving good quality of service.

Abstract

International audience; Software Defined Networking (SDN) has attracted tremendous interest in the telecommunication industry due to its ability to abstract, manage and dynamically re-configure end-to-end networks from a centralized controller. Though SDN is considered to be a suitable candidate for various use cases in mobile networks, none of the work so far has discussed its advantages and actual realization for Train-to-Wayside Communication System (TWC). In this paper, for the first time, the architecture and use cases of SDN controlled mobile backhauling framework for TWC is proposed. We discuss how our proposed architecture can efficiently handle mobility management and also provide dynamic quality-of-service (QoS) for different services on board. As a first step, a software prototype is developed using industrial standard OpenDayLight SDN controller to have our architecture evaluated. Since the automotive sector is being considered to be an important driver for 5G network, our SDN based mobile backhauling solution can be positioned in 5G where SDN plays an important role.

Abstract

International audience; In Software-Defined Networking, near-real-time collection of flow-level statistics provided by OpenFlow (e.g. byte count) is needed for control and management applications like traffic engineering, heavy hitters detection, attack detection, etc. The practical way to do this near-real-time collection is a periodic collection at high frequency. However, periodic polling may generate a lot of overheads expressed by the number of OpenFlow request and reply messages on the control network. To handle these overheads, adaptive techniques based on the pull model were proposed. But we can do better by detaching from the classical OpenFlow request-reply model for the particular case of periodic statistics collection. In light of this, we propose a push and prediction based adaptive collection to handle efficiently periodic OpenFlow statistics collection while maintaining good accuracy. We utilize the Ryu Controller and Mininet to implement our solution and then we carry out intensive experiments using real-world traces. The results show that our proposed approach can reduce the number of pushed messages up to 75% compared to a fixed periodic collection with a very good accuracy represented by a collection error of less than 0.5%.