3 research outputs found

    p-Cycle Based Protection in WDM Mesh Networks

    Get PDF
    Abstract p-Cycle Based Protection in WDM Mesh Networks Honghui Li, Ph.D. Concordia University, 2012 WDM techniques enable single fiber to carry huge amount of data. However, optical WDM networks are prone to failures, and therefore survivability is a very important requirement in the design of optical networks. In the context of network survivability, p-cycle based schemes attracted extensive research interests as they well balance the recovery speed and the capacity efficiency. Towards the design of p-cycle based survivableWDM mesh networks, some issues still need to be addressed. The conventional p-cycle design models and solution methods suffers from scalability issues. Besides, most studies on the design of p-cycle based schemes only cope with single link failures without any concern about single node failures. Moreover, loop backs may exist in the recovery paths along p-cycles, which lead to unnecessary stretching of the recovery path lengths. This thesis investigates the scalable and efficient design of segment p-cycles against single link failures. The optimization models and their solutions rely on large-scale optimization techniques, namely, Column Generation (CG) modeling and solution, where segment pcycle candidates are dynamically generated during the optimization process. To ensure full node protection in the context of link p-cycles, we propose an efficient protection scheme, called node p-cycles, and develop a scalable optimization design model. It is shown that, depending on the network topology, node p-cycles sometimes outperform path p-cycles in iii terms of capacity efficiency. Also, an enhanced segment p-cycle scheme is proposed, entitled segment Np-cycles, for full link and node protection. Again, the CG-based optimization models are developed for the design of segment Np-cycles. Two objectives are considered, minimizing the spare capacity usage and minimizing the CAPEX cost. It is shown that segment Np-cycles can ensure full node protection with marginal extra cost in comparison with segment p-cycles for link protection. Segment Np-cycles provide faster recovery speed than path p-cycles although they are slightly more costly than path p-cycles. Furthermore, we propose the shortcut p-cycle scheme, i.e., p-cycles free of loop backs for full node and link protection, in addition to shortcuts in the protection paths. A CG-based optimization model for the design of shortcut p-cycles is formulated as well. It is shown that, for full node protection, shortcut p-cycles have advantages over path p-cycles with respect to capacity efficiency and recovery speed. We have studied a whole sequence of protection schemes from link p-cycles to path p-cycles, and concluded that the best compromise is the segment Np-cycle scheme for full node protection with respect to capacity efficiency and recovery time. Therefore, this thesis offers to network operators several interesting alternatives to path p-cycles in the design of survivable WDM mesh networks against any single link/node failures

    Cross-layer modeling and optimization of next-generation internet networks

    Get PDF
    Scaling traditional telecommunication networks so that they are able to cope with the volume of future traffic demands and the stringent European Commission (EC) regulations on emissions would entail unaffordable investments. For this very reason, the design of an innovative ultra-high bandwidth power-efficient network architecture is nowadays a bold topic within the research community. So far, the independent evolution of network layers has resulted in isolated, and hence, far-from-optimal contributions, which have eventually led to the issues today's networks are facing such as inefficient energy strategy, limited network scalability and flexibility, reduced network manageability and increased overall network and customer services costs. Consequently, there is currently large consensus among network operators and the research community that cross-layer interaction and coordination is fundamental for the proper architectural design of next-generation Internet networks. This thesis actively contributes to the this goal by addressing the modeling, optimization and performance analysis of a set of potential technologies to be deployed in future cross-layer network architectures. By applying a transversal design approach (i.e., joint consideration of several network layers), we aim for achieving the maximization of the integration of the different network layers involved in each specific problem. To this end, Part I provides a comprehensive evaluation of optical transport networks (OTNs) based on layer 2 (L2) sub-wavelength switching (SWS) technologies, also taking into consideration the impact of physical layer impairments (PLIs) (L0 phenomena). Indeed, the recent and relevant advances in optical technologies have dramatically increased the impact that PLIs have on the optical signal quality, particularly in the context of SWS networks. Then, in Part II of the thesis, we present a set of case studies where it is shown that the application of operations research (OR) methodologies in the desing/planning stage of future cross-layer Internet network architectures leads to the successful joint optimization of key network performance indicators (KPIs) such as cost (i.e., CAPEX/OPEX), resources usage and energy consumption. OR can definitely play an important role by allowing network designers/architects to obtain good near-optimal solutions to real-sized problems within practical running times

    Off-line and in-operation optical core networks planning

    Get PDF
    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
    corecore