Scalable Path Computation Flooding Approach for PCE-Based Multi-domain Networks

ETRI Journal

关键词: domain sequence;    BRPC;    PCE;    Multi-domain;   

Others  :  1185926
DOI  :  10.4218/etrij.10.0210.0063

【 摘 要 】

In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.

   

【 参考文献 】

• [1]E. Mannie, "Generalized Multi-Protocol Label Switching (GMPLS) Architecture," IETF RFC 3945, Oct. 2004.
• [2]A. Farrel, J.P. Vasseur, and J. Ash, "A Path Computation Element (PCE)-Based Architecture," IETF RFC 4655, Aug. 2006.
• [3]J.P. Vasseur et al., "A Backward-Recursive PCE-Based Computation Procedure (BRPC) to Compute Shortest Constrained Inter-domain Traffic Engineering LSPs," IETF RFC 5441, Apr. 2009.
• [4]D. King and A. Farrel, "The Application of the PCE Architecture to the Determination of a Sequence of Domains in MPLS & GMPLS," IETF draft draft-king-pce-hierarchy-fwk-03.txt, Dec. 2009.
• [5]J.P. Vasseur and J.L. Le Roux, "Path Computation Element (PCE) Communication Protocol (PCEP), IETF RFC 5440, Mar. 2009.