Abstract
Next-generation optical transport networks will include multiple domains with diverse technologies, protocols, granularities, and carriers. In such networks, the problem of routing and wavelength assignment (RWA) aims to find an adequate route and wavelength(s) for lightpaths carrying end-to-end service demands subject to scalability constraints. Recently, a framework for multi-domain path computation called Backward Recursive Path Computation (BRPC) was standardized by the Internet Engineering Task Force (IETF). In this paper, we propose algorithms using the BRPC framework to dynamically set up end-to-end lightpaths across multiple domains so that the Quality of Transmission (QoT) of connections is satisfied, and the network-level performance metric of blocking probability is minimized. An algorithm based on dynamic programming is proposed and its performance is analyzed by simulation studies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
