论文信息 - A dynamic routing algorithm for multi-domain photonic networks using averaged link load information

A dynamic routing algorithm for multi-domain photonic networks using averaged link load information

We propose an inter-domain path routing algorithm for multi domain photonic networks. The proposed algorithm introduces a step-wise weighting technique and utilizes averaged link load information of each domain. Numerical experiments demonstrate that the proposed algorithm matches the blocking probability achieved without domain segmentation.

[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[3] Adrian Farrel,et al. Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Path-Key-Based Mechanism , 2009, RFC.

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

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

[6] Eric Mannie,et al. Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.