A hierarchical Path Computation Element (PCE)-based k-random-paths routing algorithm in multi-domain WDM networks

详细信息    查看全文

• 作者：Shengfeng Shang  ; ;   ; ^a ;   ; ^{shangsf04@mails.tsinghua.edu.cn} ; Nan Hua^a ; Lei Wang^a ; Rui Lu^a ; Xiaoping Zheng^a ; Hanyi Zhang^a
• 关键词：Hierarchical PCE ; Node pair ; PCEP ; MathURL&_method=retrieve&_eid=1-s2.0-S1573427711000543&_mathId=si56.gif&_pii=S1573427711000543&_issn=15734277&_ac
• 刊名：Optical Switching and Networking
• 出版年：2011
• 出版时间：December 2011
• 年：2011
• 卷：8
• 期：4
• 页码：235-241
• 全文大小：1258 K

文摘

We propose an inter-domain routing algorithm for multi-domain wavelength-division multiplexing (WDM) mesh networks. On the basis of the hierarchical Path Computation Element (PCE) architecture, the proposed algorithm introduces a random path strategy in the parent PCE to adjust the algorithm optimization level. Simulation results indicate that the proposed algorithm outperforms previous schemes in terms of blocking probability and resource utilization, while preventing the increase in PCEP signaling overhead.