Path Computation Element Communication Protocol (PCEP) Requirements and Protocol Extensions in Support of Global Concurrent Optimization

The Path Computation Element (PCE) is a network component, application, or node that is capable of performing path computations at the request of Path Computation Clients (PCCs). The PCE is applied in Multiprotocol Label Switching Traffic Engineering (MPLS-TE) networks and in Generalized MPLS (GMPLS) networks to determine the routes of Label Switched Paths (LSPs) through the network. The Path Computation Element Communication Protocol (PCEP) is specified for communications between PCCs and PCEs, and between cooperating PCEs. When computing or re-optimizing the routes of a set of LSPs through a network it may be advantageous to perform bulk path computations in order to avoid blocking problems and to achieve more optimal network- wide solutions. Such bulk optimization is termed Global Concurrent Optimization (GCO). A Global Concurrent Optimization is able to simultaneously consider the entire topology of the network and the complete set of existing LSPs, and their respective constraints, and look to optimize or re-optimize the entire network to satisfy all constraints for all LSPs. The Global Concurrent Optimization (GCO) application is primarily an NMS based solution. This document provides application-specific requirements and the PCEP extensions in support of a global concurrent optimization (GCO) application.

[1]  Jean-Louis Le Roux,et al.  Path Computation Element (PCE) Communication Protocol Generic Requirements , 2006, RFC.

[2]  Adrian Farrel,et al.  A Path Computation Element (PCE)-Based Architecture , 2006, RFC.

[3]  Jean-Louis Le Roux,et al.  Requirements for Path Computation Element (PCE) Discovery , 2006, RFC.

[4]  Jean-Louis Le Roux,et al.  OSPF Protocol Extensions for Path Computation Element (PCE) Discovery , 2008, RFC.

[5]  Deborah Brungard,et al.  Requirements for GMPLS-Based Multi-Region and Multi-Layer Networks (MRN/MLN) , 2008, RFC.

[6]  Emile Stephan,et al.  PCE communication protocol(PCEP) Management Information Base , 2008 .

[7]  Jean-Louis Le Roux,et al.  Path Computation Element (PCE) Communication Protocol (PCEP) , 2009, RFC.

[8]  Eiji Oki,et al.  Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions , 2009, RFC.

[9]  Jean-Louis Le Roux,et al.  Network Working Group Encoding of Objective Functions in the Path Computation Element Communication Protocol (pcep) , 2009 .

[10]  Jean-Louis Le Roux,et al.  IS-IS Protocol Extensions for Path Computation Element (PCE) Discovery , 2008, RFC.

[11]  Scott O. Bradner,et al.  Key words for use in RFCs to Indicate Requirement Levels , 1997, RFC.

[12]  Jean-Louis Le Roux,et al.  A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths , 2009, RFC.

[13]  Eiji Oki,et al.  Framework for PCE-Based Inter-Layer MPLS and GMPLS Traffic Engineering , 2009, RFC.

[14]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[15]  Adrian Farrel,et al.  Routing Backus-Naur Form (RBNF): A Syntax Used to Form Encoding Rules in Various Routing Protocol Specifications , 2009, RFC.