43 research outputs found

    MPLS based recovery mechanisms

    Get PDF
    Multi-protocol label switching (MPLS) integrates the label swapping forwarding paradigm with network layer routing. To deliver reliable service, MPLS requires a set of procedures to provide protection of the traffic carried on different paths. This requires that the label switching routers (LSRs) support fault detection, fault notification, and fault recovery mechanisms, and that MPLS signaling supports the configuration of recovery. The purpose of this work is to evaluate the different recovery mechanisms proposed by the IETF, by literature study and simulation experiments

    Real-time bandwidth encapsulation for IP/MPLS Protection Switching

    Get PDF
    Bandwidth reservation and bandwidth allocation are needed to guarantee the protection of voice traffic during network failure. Since voice calls have a time constraint of 50 ms within which the traffic must be recovered, a real-time bandwidth management scheme is required. Such bandwidth allocation scheme that prioritizes voice traffic will ensure that the voice traffic is guaranteed the necessary bandwidth during the network failure. Additionally, a mechanism is also required to provide the bandwidth to voice traffic when the reserved bandwidth is insufficient to accommodate voice traffic. This mechanism must be able to utilise the working bandwidth or bandwidth reserved for lower priority applications and allocate it to the voice traffic when a network failure occurs

    Traffic engineering in dynamic optical networks

    Get PDF
    Traffic Engineering (TE) refers to all the techniques a Service Provider employs to improve the efficiency and reliability of network operations. In IP over Optical (IPO) networks, traffic coming from upper layers is carried over the logical topology defined by the set of established lightpaths. Within this framework then, TE techniques allow to optimize the configuration of optical resources with respect to an highly dynamic traffic demand. TE can be performed with two main methods: if the demand is known only in terms of an aggregated traffic matrix, the problem of automatically updating the configuration of an optical network to accommodate traffic changes is called Virtual Topology Reconfiguration (VTR). If instead the traffic demand is known in terms of data-level connection requests with sub-wavelength granularity, arriving dynamically from some source node to any destination node, the problem is called Dynamic Traffic Grooming (DTG). In this dissertation new VTR algorithms for load balancing in optical networks based on Local Search (LS) techniques are presented. The main advantage of using LS is the minimization of network disruption, since the reconfiguration involves only a small part of the network. A comparison between the proposed schemes and the optimal solutions found via an ILP solver shows calculation time savings for comparable results of network congestion. A similar load balancing technique has been applied to alleviate congestion in an MPLS network, based on the efficient rerouting of Label-Switched Paths (LSP) from the most congested links to allow a better usage of network resources. Many algorithms have been developed to deal with DTG in IPO networks, where most of the attention is focused on optimizing the physical resources utilization by considering specific constraints on the optical node architecture, while very few attention has been put so far on the Quality of Service (QoS) guarantees for the carried traffic. In this thesis a novel Traffic Engineering scheme is proposed to guarantee QoS from both the viewpoint of service differentiation and transmission quality. Another contribution in this thesis is a formal framework for the definition of dynamic grooming policies in IPO networks. The framework is then specialized for an overlay architecture, where the control plane of the IP and optical level are separated, and no information is shared between the two. A family of grooming policies based on constraints on the number of hops and on the bandwidth sharing degree at the IP level is defined, and its performance analyzed in both regular and irregular topologies. While most of the literature on DTG problem implicitly considers the grooming of low-speed connections onto optical channels using a TDM approach, the proposed grooming policies are evaluated here by considering a realistic traffic model which consider a Dynamic Statistical Multiplexing (DSM) approach, i.e. a single wavelength channel is shared between multiple IP elastic traffic flows

    Foutbestendige toekomstige internetarchitecturen

    Get PDF

    Advanced features of MPLS technology

    Get PDF
    Tato prĂĄce se zabĂœvĂĄ technologiĂ­ Multiprotocol Label Switching a to zejmĂ©na modernĂ­mi metodami, kterĂ© je moĆŸnĂ© pouĆŸĂ­t v rĂĄmci tĂ©to technolologie. Jako pƙíklad lze uvĂ©st vyuĆŸitĂ­ podpory kvality sluĆŸeb pƙi směrovĂĄnĂ­. V prĂĄci jsou navrhnuty a simulovĂĄny rĆŻznĂ© topologie a scĂ©náƙe, kterĂ© ověƙujĂ­ moĆŸnosti vyuĆŸitĂ­ MPLS v podpoƙe kvality sluĆŸeb.This work is considered to evaluate the needs of MPLS implementation in current IP networks with respect to Quality of Service guarantees. It shows many aspects and evaluations of the influence of different traffic classes. The best solutions are evaluated with simulations and can be implemented with respect to Quality of Service guarantees.

    Dynamic bandwidth allocation in multi-class IP networks using utility functions.

    Get PDF
    PhDAbstact not availableFujitsu Telecommunications Europe Lt

    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

    MPLS (Multi-Protocol Label Switching) assisted routing procedure in Software Defined Networking (SDN)

    Get PDF
    Thesis submitted in partial fulfillment of the requirements for the Degree of Master of Science in Information Technology (MSIT) at Strathmore UniversityMulti-protocol label switching has been incorporated into provider networks to provide quality of service. Owing to the design of the protocol, its ability to push and pop labels in packets, independent of their underlying protocol makes it popular in interconnecting multiple networks in to one transport pipeline. At the same time, multi-protocol label switching has proven to be a very fast procedure for forwarding devices because the central processing unit cycles required in making a forwarding decision is far less compared to traditional forwarding decision-making metrics like analyzing the internet protocol header. However, current multi-protocol label switching implementation is a complex configuration procedure and does not provide a central bird’s eye view of the network topology to network engineers. Logging in to every label switching router and loading multi-protocol label switching configurations to allow it to connect to neighboring label switching routers in the label switching path is required. Allowing network engineers to have a central view and control of the network topology while still providing multi-protocol label switching services in a simplistic approach will make them achieve adaptive routing and traffic engineering seamlessly. This will improve quality of service and quality of experience in transport networks. Software defined networking is the approach this research takes towards providing central control because of the flexibility, programmability, and adaptability of the technology. This work proposed the design of a routing procedure that will implement multi-protocol label switching on a software defined network via OpenFlow. Experimental synthesis and prototyping approach was used to achieve the research objectives. A simulated environment called Mininet provided the implementation test bed. Internet control message packets were the test data to show how multi-protocol label switching labels are added and stripped. An illustration of the packet capture information from the experiment was presented and analyzed

    Restoration in multi-domain GMPLS-based networks

    Get PDF
    In this paper, we evaluate the efficiency of using restoration mechanisms in a dynamic multi-domain GMPLS network. Major challenges and solutions are introduced and two well-known restoration schemes (End-to-End and Local-to-End) are evaluated. Additionally, new restoration mechanisms are introduced: one based on the position of a failed link, called Location-Based, and another based on minimizing the additional resources consumed during restoration, called Shortest-New. A complete set of simulations in different network scenarios show where each mechanism is more efficient in terms, such as, resource overbuild or recovery delayPart of this work was supported by the Government of Catalonia (DURSI SGR-1202), and by the Spanish Science and Innovation Ministry (TRION TEC2009-10724
    corecore