Share Email Print
cover

Proceedings Paper

A collision-aware backward recursive PCE-based computation algorithm in multi-domain optical networks
Author(s): Jianchao Xing; Jie Zhang; Yongli Zhao; Xuping Cao; Dajiang Wang; Wanyi Gu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The traditional approach for inter-domain Traffic Engineering Label Switching Path (TE-LSP) computation like BRPC could provide a shortest inter-domain constrained TE-LSP, but under wavelength continuity constraint, it couldn't guarantee the success of the resources reservation for the shortest path. In this paper, a Collision-aware Backward Recursive PCE-based Computation Algorithm (CA-BRPC) in multi-domain optical networks under wavelength continuity constraint is proposed, which is implemented based on Hierarchical PCE (H-PCE) architecture, could provide an optimal inter-domain TE-LSP and avoid resources reservation conflict. Numeric results show that the CA-BRPC could reduce the blocking probability of entire network.

Paper Details

Date Published: 15 December 2011
PDF: 6 pages
Proc. SPIE 8310, Network Architectures, Management, and Applications IX, 831010 (15 December 2011); doi: 10.1117/12.904406
Show Author Affiliations
Jianchao Xing, Beijing Univ. of Posts and Telecommunications (China)
Jie Zhang, Beijing Univ. of Posts and Telecommunications (China)
Yongli Zhao, Beijing Univ. of Posts and Telecommunications (China)
Xuping Cao, ZTE Corp. (China)
Dajiang Wang, ZTE Corp. (China)
Wanyi Gu, Beijing Univ. of Posts and Telecommunications (China)


Published in SPIE Proceedings Vol. 8310:
Network Architectures, Management, and Applications IX
Lena Wosinska; Ken-ichi Sato; Jing Wu; Jie Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top