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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.