A Survey on the Path Computation Element (PCE) Architecture

Quality of Service-enabled applications and services rely on Traffic Engineering-based (TE) Label Switched Paths (LSP) established in core networks and controlled by the GMPLS control plane. Path computation process is crucial to achieve the desired TE objective. Its actual effectiveness depends on a number of factors. Mechanisms utilized to update topology and TE information, as well as the latency between path computation and resource reservation, which is typically distributed, may affect path computation efficiency. Moreover, TE visibility is limited in many network scenarios, such as multi-layer, multi-domain and multi-carrier networks, and it may negatively impact resource utilization. The Internet Engineering Task Force (IETF) has promoted the Path Computation Element (PCE) architecture, proposing a dedicated network entity devoted to path computation process. The PCE represents a flexible instrument to overcome visibility and distributed provisioning inefficiencies. Communications between path computation clients (PCC) and PCEs, realized through the PCE Protocol (PCEP), also enable inter-PCE communications offering an attractive way to perform TE-based path computation among cooperating PCEs in multi-layer/domain scenarios, while preserving scalability and confidentiality. This survey presents the state-of-the-art on the PCE architecture for GMPLS-controlled networks carried out by research and standardization community. In this work, packet (i.e., MPLS-TE and MPLS-TP) and wavelength/spectrum (i.e., WSON and SSON) switching capabilities are the considered technological platforms, in which the PCE is shown to achieve a number of evident benefits

Traffic allocation strategies in WSS-based dynamic optical networks

Elastic optical networking (EON) is a viable solution to meet future dynamic capacity requirements of Internet service provider and inter-datacenter networks. At the core of EON, wavelength selective switches (WSSs) are applied to individually route optical circuits, while assigning an arbitrary bandwidth to each circuit. Critically, the WSS control scheme and configuration time may delay the creation time of each circuit in the network. In this paper, we first detail the WSS-based optical data-plane implementation of a metropolitan network test-bed. Then, we review a software-defined networking (SDN) application designed to enable dynamic and fast circuit setup. Subsequently, we introduce a WSS logical model that captures the WSS time-sequence and is used to estimate the circuit-setup response time. Then, we present two batch service policies that aim to reduce the circuit-setup response time by bundling multiple WSS reconfiguration steps into a single SDN command. Resulting performance gains are estimated through simulation.Peer ReviewedPostprint (author's final draft

Dynamic routing and load balancing in IP-over-WDM networks

Master'sMASTER OF ENGINEERIN

Some open issues in multi-domain/multi-operator/multi-granular ASON/GMPLS networks

Large optical backbone networks may be composed of several domains, each one controlled by different administrators/operators. Besides, the bandwidth granularity of these domains may be different. Label Switched Paths (LSPs) provisioning in multi-domain/multi-operators/multi-layer network scenarios is a challenging problem actually, which has to be properly faced. In this paper, some open issues related to end-to-end bandwidth provisioning are discussed. Among others, the grooming problem in multi-layer/multi-domain optical networks and the performance degradation of recovery mechanisms due to limited inter-domain knowledge are analyzed.Postprint (published version

Preserving confidentiality in PCE-based multi-domain networks

n/

Dynamic grooming in IP over WDM networks: A study with realistic traffic based on GANCLES simulation package

Abstract — Dynamic grooming capabilities lies at the hearth of many envisaged scenarios for IP over Optical networks, but studies on its performance are still in their infancy. This work addresses two fundamental aspects of the problem. First of all it presents a novel tool for the study of IP over Optical networks. The tool, freely available on-line, is a network level simulator named GANCLES that includes several innovative features allowing the study of realistic scenarios in IP over Optical networking, making it an ideal tool for Traffic Engineering purposes. GANCLES architecture enables the simulation of dynamic traffic grooming on top of a realistic network model that correctly describes the logical interaction between the optical and the IP layer, i.e., the mutual relationship between routing algorithms and lightpath assignment procedures at the optical layer and routing at th

Traffic engineering in dynamic optical networks

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

In-operation planning in flexgrid optical core networks

New generation applications, such as cloud computing or video distribution, can run in a telecom cloud infrastructure where the datacenters (DCs) of telecom operators are integrated in their networks thus, increasing connections' dynamicity and resulting in time-varying traffic capacities, which might also entail changes in the traffic direction along the day. As a result, a flexible optical technology able to dynamically set-up variable-capacity connections, such as flexgrid, is needed. Nonetheless, network dynamicity might entail network performance degradation thus, requiring re-optimizing the network while it is in operation. This thesis is devoted to devise new algorithms to solve in-operation network planning problems aiming at enhancing the performance of optical networks and at studying their feasibility in experimental environments. In-operation network planning requires from an architecture enabling the deployment of algorithms that must be solved in stringent times. That architecture can be based on a Path Computation Element (PCE) or a Software Defined Networks controller. In this thesis, we assume the former split in a front-end PCE, in charge of provisioning paths and handling network events, and a specialized planning tool in the form of a back-end PCE responsible for solving in-operation planning problems. After the architecture to support in-operation planning is assessed, we focus on studying the following applications: 1) Spectrum fragmentation is one of the most important problems in optical networks. To alleviate it to some extent without traffic disruption, we propose a hitless spectrum defragmentation strategy. 2) Each connection affected by a failure can be recovered using multiple paths to increase traffic restorability at the cost of poor resource utilization. We propose re-optimizing the network after repairing the failure to aggregate and reroute those connections to release spectral resources. 3) We study two approaches to provide multicast services: establishing a point-to-multipoint connections at the optical layer and using multi-purpose virtual network topologies (VNT) to serve both unicast and multicast connectivity requests. 4) The telecom cloud infrastructure, enables placing contents closer to the users. Based on it, we propose a hierarchical content distribution architecture where VNTs permanently interconnect core DCs and metro DCs periodically synchronize contents to the core DCs. 5) When the capacity of the optical backbone network becomes exhausted, we propose using a planning tool with access to inventory and operation databases to periodically decide the equipment and connectivity to be installed at the minimum cost reducing capacity overprovisioning. 6) In multi-domain multi-operator scenarios, a broker on top of the optical domains can provision multi-domain connections. We propose performing intra-domain spectrum defragmentation when no contiguous spectrum can be found for a new connection request. 7) Packet nodes belonging to a VNT can collect and send incoming traffic monitoring data to a big data repository. We propose using the collected data to predict next period traffic and to adapt the VNT to future conditions. The methodology followed in this thesis consists in proposing a problem statement and/or a mathematical formulation for the problems identified and then, devising algorithms for solving them. Those algorithms are simulated and then, they are experimentally assessed in real test-beds. This thesis demonstrates the feasibility of performing in-operation planning in optical networks, shows that it enhances the performance of the network and validates the feasibility of its deployment in real networks. It shall be mentioned that part of the work reported in this thesis has been done within the framework of several research projects, namely IDEALIST (FP7-ICT-2011-8) and GEANT (238875) funded by the EC and SYNERGY (TEC2014-59995-R) funded by the MINECO.Les aplicacions de nova generació, com ara el cloud computing o la distribució de vídeo, es poden executar a infraestructures de telecom cloud (TCI) on operadors integren els seus datacenters (DC) a les seves xarxes. Aquestes aplicacions fan que incrementi tant la dinamicitat de les connexions, com la variabilitat de les seves capacitats en el temps, arribant a canviar de direcció al llarg del dia. Llavors, cal disposar de tecnologies òptiques flexibles, tals com flexgrid, que suportin aquesta dinamicitat a les connexions. Aquesta dinamicitat pot degradar el rendiment de la xarxa, obligant a re-optimitzar-la mentre és en operació. Aquesta tesis està dedicada a idear nous algorismes per a resoldre problemes de planificació sobre xarxes en operació (in-operation network planning) per millorar el rendiment de les xarxes òptiques i a estudiar la seva factibilitat en entorns experimentals. Aquests problemes requereixen d’una arquitectura que permeti desplegar algorismes que donin solucions en temps restrictius. L’arquitectura pot estar basada en un Element de Computació de Rutes (PCE) o en un controlador de Xarxes Definides per Software. En aquesta tesis, assumim un PCE principal encarregat d’aprovisionar rutes i gestionar esdeveniments de la xarxa, i una eina de planificació especialitzada en forma de PCE de suport per resoldre problemes d’in-operation planning. Un cop validada l’arquitectura que dona suport a in-operation planning, estudiarem les següents aplicacions: 1) La fragmentació d’espectre és un dels principals problemes a les xarxes òptiques. Proposem reduir-la en certa mesura, fent servir una estratègia que no afecta al tràfic durant la desfragmentació. 2) Cada connexió afectada per una fallada pot ser recuperada fent servir múltiples rutes incrementant la restaurabilitat de la xarxa, tot i empitjorar-ne la utilització de recursos. Proposem re-optimitzar la xarxa després de reparar una fallada per agregar i re-enrutar aquestes connexions tractant d’alliberar recursos espectrals. 3) Estudiem dues solucions per aprovisionar serveis multicast: establir connexions punt-a-multipunt sobre la xarxa òptica i utilitzar Virtual Network Topologies (VNT) multi-propòsit per a servir peticions de connectivitat tant unicast com multicast. 4) La TCI permet mantenir els continguts a prop dels usuaris. Proposem una arquitectura jeràrquica de distribució de continguts basada en la TCI, on els DC principals s’interconnecten per mitjà de VNTs permanents i els DCs metropolitans periòdicament sincronitzen continguts amb els principals. 5) Quan la capacitat de la xarxa òptica s’exhaureix, proposem utilitzar una eina de planificació amb accés a bases de dades d’inventari i operacionals per decidir periòdicament l’equipament i connectivitats a instal·lar al mínim cost i reduir el sobre-aprovisionament de capacitat. 6) En entorns multi-domini multi-operador, un broker per sobre dels dominis òptics pot aprovisionar connexions multi-domini. Proposem aplicar desfragmentació d’espectre intra-domini quan no es pot trobar espectre contigu per a noves peticions de connexió. 7) Els nodes d’una VNT poden recollir i enviar informació de monitorització de tràfic entrant a un repositori de big data. Proposem utilitzar aquesta informació per adaptar la VNT per a futures condicions. La metodologia que hem seguit en aquesta tesis consisteix en formalitzar matemàticament els problemes un cop aquests son identificats i, després, idear algorismes per a resoldre’ls. Aquests algorismes son simulats i finalment validats experimentalment en entorns reals. Aquesta tesis demostra la factibilitat d’implementar mecanismes d’in-operation planning en xarxes òptiques, mostra els beneficis que aquests aporten i valida la seva aplicabilitat en xarxes reals. Part del treball presentat en aquesta tesis ha estat dut a terme en el marc dels projectes de recerca IDEALIST (FP7-ICT-2011-8) i GEANT (238875), finançats per la CE, i SYNERGY (TEC2014-59995-R), finançat per el MINECO.Postprint (published version