• DocumentCode
    73000
  • Title

    PCE: What is It, How Does It Work and What are Its Limitations?

  • Author

    Munoz, Raul ; Casellas, Ramon ; Martinez, Ricardo ; Vilalta, Ricard

  • Author_Institution
    Centre Tecnol. de Telecomunicacions de Catalunya (CTTC), Castelldefels, Spain
  • Volume
    32
  • Issue
    4
  • fYear
    2014
  • fDate
    Feb.15, 2014
  • Firstpage
    528
  • Lastpage
    543
  • Abstract
    In GMPLS-controlled optical networks, the utilization of source-based path computation has some limitations, especially in large networks with stringent constraints (e.g., optical impairments) or in multilayer and multidomain networks, which leads to suboptimal routing solutions. The path computation eElement (PCE) can mitigate some weaknesses of GMPLS-controlled optical networks. The main idea behind the PCE is to decouple the path computation function from the GMPLS controllers into a dedicated entity with an open and well-defined interface and protocol. A (stateless) PCE is capable of computing a network path or route based on a network graph (i.e., the traffic engineering database-TED) and applying computational constraints. First, we present an overview of the PCE architecture and its communication protocol (PCEP). Then, we present in detail the considered source-routing shortcomings in GMPLS-controlled networks, namely, impairment-aware path computation, multidomain path computation and multilayer path computation, as well as the different PCE-based solutions that have been proposed to overcome each one of these problems. However, PCE-based computation also presents some limitations that lead to an increase in the path computation blocking or to suboptimal path computations. The stateful PCE overcomes the limitations of the stateless PCE, such as the outdated TED, the lack of global LSP state (i.e., set of computed paths and reserved resources in use in the network), and the lack of control of path reservations. A passive stateful PCE allows optimal path computation and increased path computation success, considering both the network state (TED) and the Label Switched Paths (LSP) state (LSP Database-LSPDB). Additionally, an active stateful PCE can modify existing LSPs (i.e., connections), and optionally, setup and/or release existing LSPs. Finally, the formal decoupling of the path computation allows more flexibility in the deployment of PCEs in other control- paradigms outside their original scope (MPLS/GMPLS). In this sense, we provide an overview of three PCE deployment models in the software defined network (SDN) control architecture.
  • Keywords
    multiprotocol label switching; telecommunication network routing; GMPLS controlled optical networks; LSP; PCE communication protocol; PCEP; SDN; TED; generalized multiprotocol label switching; impairment-aware path computation; label switched paths; multidomain path computation; multilayer path computation; network graph; optimal path computation; path computation blocking; path computation element; path reservations; software defined network; source routing; source-based path computation; suboptimal routing solutions; traffic engineering database; Computer architecture; Optical fiber networks; Optical noise; Routing; Routing protocols; Signal to noise ratio; Control plane; generalized multiprotocol label switching (GMPLS); multidomain path computation; multilayer path computation; openflow; optical networks; path computation element (PCE); software defined networks (SDN); stateful PCE; stateless PCE;
  • fLanguage
    English
  • Journal_Title
    Lightwave Technology, Journal of
  • Publisher
    ieee
  • ISSN
    0733-8724
  • Type

    jour

  • DOI
    10.1109/JLT.2013.2276911
  • Filename
    6575135