Survivable multipath provisioning schemes in mesh transport networks

Back to the 1 960s, Internet originated from the military research of survivable, fault-tolerant and distributed computer networks. Half-century later, quarter of Earth' s population use Internet services. International business transactions are promoted by the accelerated information interaction across the world. With the prosperity Internet brought to our society, its survivability and capacity become an important issue. We investigate the problem of efficient multipath provisioning in backbone mesh networks by employing pool sharing and traffic decentralization techniques such as working and backup traffic split and mix-routing. With Multipath provisioning, a connection request can be split and diversely routed on to several paths. A feature that has two improvements over single-path provisioning: 1 ) load balancing among working paths, and 2) reducing the bandwidth of backup path. However, these diversely routed paths are subject to the limitation of network topology, which limit the number of available paths that can be found inside the network

Split spectrum: a multi-channel approach to elastic optical networking

This paper introduces Split Spectrum, which enhances elastic optical networking by splitting a bulk traffic demand into multiple channels, when a single-channel transmission is prohibited by distance or spectrum availability. We performed transmission simulations to determine the maximum reach as a function of modulation format (dual polarization BPSK, QPSK, 16QAM), baud-rate (from 5 to 28 GBd), and number of ROADMs, for a Nyquist WDM super-channel with subcarrier spacing equal to 1.2 x baud-rate. Performance evaluation on two representative topologies shows that, compared to the previously proposed elastic optical networking, Split Spectrum doubles the zero-blocking load and achieves 100% higher network spectral efficiency at zero-blocking loads as a result of extended transmission distance and efficient utilization of spectrum fragments. (C) 2012 Optical Society of Americ

Multi-Path Routing and Wavelength Assignment (RWA) Algorithm for WDM Based Optical Networks

Abstract-In optical WDM networks, transmission of information along optical lines is advantageous since it has high transmission capacity, scalability, feasibility and also high reliability. But large amount of information is being carried; any problem during transmission can lead to severe damage to the data being carried. Hence it is essential to consider the routing as well as the wavelength assignment problems and then develop a combined solution for both the problems. In this paper, we propose to develop a routing and wavelength assignment algorithm for selecting the suitable alternate path for the data packets transmission. Two stages are based on the available bandwidth and the number of wavelength used in the link as construction of alternate paths, route and wavelength selection. In proposed work, Adaptive Routing and First-Fit Wavelength Assignment (AR-FFWA) algorithm to be used. For each pair of source and destination, the path with the minimum granularity values are selected as the primary path for data transmission, allocating the sufficient wavelength and the performances will be evaluated by using ns-2 simulation models. When we compared to existing system the overall blocking probability will be reduced to too low

Off-line and in-operation optical core networks planning

The ever increasing IP traffic volume has finally brought to light the high inefficiency of current wavelength-routed over rigid-grid optical networks in matching the client layer requirements. Such an issue results in the deployment of large-size, expensive and power-consuming Multiprotocol Label Switching (MPLS) layers to perform the required grooming/aggregation functionality. To deal with this problem, the emerging flexgrid technology, allowing for reduced size frequency grids, is being standardized. Flexgrid optical networks divide the spectrum into frequency slots providing finer granularity than rigid networks based on Dense Wavelength Division Multiplexing (DWDM). To find a feasible allocation, new Routing and Spectrum Allocation (RSA) algorithms for flexgrid optical networks need to be designed and evaluated. Furthermore, due to the flexibility of flexible optical networks, the aggregation functions and statistical multiplexing can be partially located in the optical layer. In addition, given the special characteristics of flexible optical networks, the traditional mechanisms for protection and recovery must be reformulated. Optical transport platforms are designed to facilitate the setting up and tearing down of optical connections (lightpaths). Combining remotely configurable optical cross-connects (OXCs) with a control plane provides the capability of automated lightpath set-up for regular provisioning, and real-time reaction to the failures, being thus able to reduce Operational Expenditures (OPEX). However, to exploit existing capacity, increase dynamicity, and provide automation in future networks, current management architectures, utilizing legacy Network Management Systems (NMS) need to be radically transformed. This thesis is devoted to design optical networks and to devise algorithms to operate them. Network design objective consists of: i. Analyzing the cost implications that a set of frequency slot widths have on the Capital Expenditures (CAPEX) investments required to deploy MPLS-over-flexgrid networks; ii. Studying recovery schemes, where a new recovery scheme specifically designed for flexgrid-based optical networks is proposed. As for network operation, we focus on: i. Studying provisioning, where two provisioning algorithms are proposed: the first one targets at solving the RSA problem in flexgrid networks, whereas the second one studies provisioning considering optical impairments in translucent DWDM networks; ii. Getting back to the recovery problem, we focus on algorithms to cope with restoration in dynamic scenarios. Several algorithms are proposed for both single layer and multilayer networks to be deployed in the centralized Path Computation Element (PCE); iii. One of the main problems in flexgrid networks is spectrum defragmentation. In view of that, we propose an algorithm to reallocate already established optical connections so as to make room for incoming requests. This algorithm is extended with elasticity to deal with time-varying traffic. The above algorithms are firstly implemented and validated by using simulation, and finally experimentally assessed in real test-beds. In view of PCE architectures do not facilitate network reconfiguration, we propose a control and management architecture to allow the network to be dynamically operated; network resources can be made available by reconfiguring and/or re-optimizing the network on demand and in real-time. We call that as in-operation network planning. It shall be mentioned that part of the work reported in this thesis has been done within the framework of several European and National projects, namely STRONGEST (FP7-247674), IDEALIST (FP7-ICT-2011-8), and GEANT (FP7-238875) funded by the European Commission, and ENGINE (TEC2008-02634) and ELASTIC (TEC2011-27310) funded by the Spanish Science Ministry.El volumen creciente del tráfico IP, finalmente, ha puesto de manifiesto la alta ineficiencia de las redes ópticas actuales de grid rígido basadas en WDM en la adecuación a los requisitos de capa de cliente. Dicho problema genera que se deba desplegar una red con capas MPLS de gran tamaño, costosa y de alto consumo energético para poder realizar la funcionalidad de agregación requerida. Para hacer frente a este problema, la tecnología flexgrid emergente, que permite grids con frecuencias de menor tamaño, está siendo estandarizada. Las redes ópticas flexgrid dividen el espectro en slots de frecuencia, lo que proporciona una granularidad más fina en comparación a las redes rígidas basadas en WDM. Para encontrar una asignación factible, nuevos algoritmos de enrutamiento y asignación de espectro (RSA) para redes ópticas flexgrid deben ser diseñados y evaluados. Además, debido a la flexibilidad de las redes ópticas flexibles, las funciones de agregación y de multiplexación estadística pueden ser parcialmente situadas en la capa óptica. Asimismo, dadas las características especiales de las redes ópticas flexibles, los mecanismos tradicionales de protección y recuperación deben reformularse. Las plataformas de transporte ópticas están diseñadas para facilitar la creación y destrucción de conexiones ópticas. La combinación de OXCs configurables remotamente con un plano de control, proporciona la capacidad de crear conexiones automáticamente para el aprovisionamiento habitual, y la reacción en tiempo real a los fallos, para así poder reducir el OPEX. Sin embargo, para aprovechar la capacidad existente, aumentar la dinamicidad y proporcionar automatización a las redes del futuro, las arquitecturas actuales de gestión, que utilizan sistemas legados de NMS, necesitan ser transformadas de manera radical. Esta tesis está dedicada al diseño de redes ópticas y a la creación de algoritmos para operarlas. El objetivo de diseño de red se compone de: 1. El análisis de las implicancias en el costo que tiene un conjunto de slots de frecuencia en el CAPEX necesario para implementar redes MPLS-over-flexgrid; 2. El estudio de esquemas de recuperación, donde se propone un nuevo esquema de recuperación diseñado específicamente para las redes ópticas basadas en flexgrid. En cuanto a la operación de la red: 1. El estudio de aprovisionamiento, donde se proponen dos algoritmos de aprovisionamiento: el primero de ellos tiene como objetivo solucionar el problema de RSA en redes flexgrid, mientras que el segundo estudia aprovisionamiento considerando la degradación óptica en redes WDM translúcidas; 2. Volviendo al problema de la recuperación, nos centramos en algoritmos de restauración para escenarios dinámicos. Se proponen varios algoritmos, tanto para redes mono-capa como multi-capa, que serán desplegados en un PCE centralizado; 3. Uno de los principales problemas en las redes flexgrid es la desfragmentación del espectro. Para ello, se propone un algoritmo para reasignar las conexiones ópticas ya establecidas con el fin de hacer espacio a las entrantes. Este algoritmo se extiende con elasticidad para ser utilizado en escenarios con tráfico variable en el tiempo. Los algoritmos anteriores son primero implementados y validados utilizando simulación, y finalmente son evaluados experimentalmente en testbeds reales. En vista de que las arquitecturas de PCE no facilitan la reconfiguración de la red, proponemos una arquitectura de control y gestión para permitir que la red pueda ser operada de forma dinámica; hacer que los recursos de la red estén disponibles mediante reconfiguración y/o re-optimización de la red bajo demanda y en tiempo real. A eso lo llamamos planificación en operación de la red. El trabajo presentado en esta tesis se ha realizado en el marco de proyectos europeos y nacionales: STRONGEST (FP7-247674), IDEALIST (FP7-2011-8), y GEANT (FP7-238875) financiados por la CE, y ENGINE (TEC2008-02634) y ELASTIC (TEC2011-27310) financiados por el MINEC

Journal of Telecommunications and Information Technology, 2009, nr 1

kwartalni

Supporting differentiated classes of resilience in multilayer networks

Services provided over telecommunications networks typically have different resilience requirements and networks need to be able to support different levels of resilience in an efficient manner. This dissertation investigates the problem of supporting differentiated classes of resilience in multilayer networks, including the most stringent resilience class required by critical services. We incorporate an innovative technique of embedding a subnetwork, termed the spine, with comparatively higher availability values at the physical layer. The spine lays a foundation for differentiation between multiple classes of flows that can be leveraged to achieve both high resilience and differentiation. The aim of this research is mainly to explore, design, and evaluate the proposed spine concept model in multilayer networks. The dissertation has four major parts. First, we explore the spine concept through numerical analysis of simple topologies illustrating the potential benefits and the cost considerations of the spine. We develop heuristics algorithms to find suitable spines for a network based on the structural properties of the network topology. Second, an optimization problem is formulated to determine the spine. The problem encompasses estimates of link availability improvements, associated costs, and a total budget. Third, we propose a crosslayer mapping and spine-aware routing design problem with protection given mainly at the lower layer. The problem is designed to transfer lower layer differentiation capability to the upper layer network and flows. We provide two joint routing-mapping optimization formulations and evaluate their performance in a multilayer scenario. Fourth, the joint routing-mapping problem is redesigned with protection given in the upper network layer instead. This will create two isolated logical networks; one mapped to the spine and the other is mapped freely on the network. Flows are assigned a path or path-pair based on their class of resilience. This approach can provide more routing options yielding different availability levels. The joint routing-mapping design problems are formulated as Integer Linear Programming (ILP) models. The goal is to achieve a wider range of availability values across layers and high availability levels for mission-critical services without the need to use higher order protection configurations. The proposed models are evaluated with extensive numerical results using real network topologies

Survivable Virtual Network Embedding in Transport Networks

Network Virtualization (NV) is perceived as an enabling technology for the future Internet and the 5th Generation (5G) of mobile networks. It is becoming increasingly difficult to keep up with emerging applications’ Quality of Service (QoS) requirements in an ossified Internet. NV addresses the current Internet’s ossification problem by allowing the co-existence of multiple Virtual Networks (VNs), each customized to a specific purpose on the shared Internet. NV also facilitates a new business model, namely, Network-as-a-Service (NaaS), which provides a separation between applications and services, and the networks supporting them. 5G mobile network operators have adopted the NaaS model to partition their physical network resources into multiple VNs (also called network slices) and lease them to service providers. Service providers use the leased VNs to offer customized services satisfying specific QoS requirements without any investment in deploying and managing a physical network infrastructure. The benefits of NV come at additional resource management challenges. A fundamental problem in NV is to efficiently map the virtual nodes and virtual links of a VN to physical nodes and paths, respectively, known as the Virtual Network Embedding (VNE) problem. A VNE that can survive physical resource failures is known as the survivable VNE (SVNE) problem, and has received significant attention recently. In this thesis, we address variants of the SVNE problem with different bandwidth and reliability requirements for transport networks. Specifically, the thesis includes four main contributions. First, a connectivity-aware VNE approach that ensures VN connectivity without bandwidth guarantee in the face of multiple link failures. Second, a joint spare capacity allocation and VNE scheme that provides bandwidth guarantee against link failures by augmenting VNs with necessary spare capacity. Third, a generalized recovery mechanism to re-embed the VNs that are impacted by a physical node failure. Fourth, a reliable VNE scheme with dedicated protection that allows tuning of available bandwidth of a VN during a physical link failure. We show the effectiveness of the proposed SVNE schemes through extensive simulations. We believe that the thesis can set the stage for further research specially in the area of automated failure management for next generation networks