Utilization of temporary reservation of path computed resources for multi-domain path computation element protocols in WDM networks

In recent years, Path Computation Element (PCE) architecture has been standardized as a suitable solution for path computation in multi-domain network scenarios. The Traffic Engineering Database (TED) of the PCE is updated with the information of the control plane. However, there is a delay from the PCE replies to a request, until the TED is updated with the network status information. This delay includes not only the control plane delay, but also Path Computation Element Protocol (PCEP) information exchange. This desynchronization in the TED and the real status information leads to an extra blocking situation when the Label Switch Router (LSR) tries to reserve a path, but it has been previously reserved by other LSR. To solve such problem, a recent draft is submitted to the IETF proposing new PCEP extensions for a pre-reservation of the computed path resources for a certain period. This work implements in C three multi-domain algorithms: Per-domain Path Computation, Backward-Recursive PCE-based Computation and Hierarchical Path Computation Element and it assesses their performance with and without mechanisms to reduce this extra blocking probability due to the uncertainty of the TED information.

[1]  Ramon Casellas,et al.  PCEP Extensions for Temporary Reservation of Computed Path Resources and Support for Limited Context State in PCE , 2010 .

[2]  Ramon Casellas,et al.  Lab trial of multi-domain path computation in GMPLS controlled WSON using a hierarchical PCE , 2011, 2011 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference.

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

[4]  Jean-Philippe Vasseur,et al.  A Per-Domain Path Computation Method for Establishing Inter-Domain Traffic Engineering (TE) Label Switched Paths (LSPs) , 2008, RFC.

[5]  Mohit Chamania,et al.  A survey of inter-domain peering and provisioning solutions for the next generation optical networks , 2009, IEEE Communications Surveys & Tutorials.

[6]  Yuefeng Ji,et al.  Routing and Wavelength Assignment Problem in PCE-Based Wavelength-Switched Optical Networks , 2010, IEEE/OSA Journal of Optical Communications and Networking.

[7]  R. Martinez,et al.  Enhanced Backwards Recursive Path Computation for Multi-area Wavelength Switched Optical Networks Under Wavelength Continuity Constraint , 2009, IEEE/OSA Journal of Optical Communications and Networking.

[8]  V. Lopez,et al.  Path computation element in telecom networks: Recent developments and standardization activities , 2010, 2010 14th Conference on Optical Network Design and Modeling (ONDM).

[9]  S. Chandrasekhar,et al.  Linear and nonlinear performance of 42.7-Gb/s single-polarization RZ-DQPSK format , 2006, IEEE Photonics Technology Letters.

[10]  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.

[11]  Jean-Philippe Vasseur,et al.  Path-Computation-Element-Based Architecture for Interdomain MPLS/GMPLS Traffic Engineering: Overview and Performance , 2007, IEEE Network.

[12]  Piero Castoldi,et al.  Path state-based update of PCE traffic engineering database in wavelength switched optical networks , 2010, IEEE Communications Letters.

[13]  Angela Chiu,et al.  Issues for routing in the optical layer , 2001, IEEE Commun. Mag..