Abstract
The problem of dynamic provisioning of optical channels in a DWDM optical network is considered. Methodologies and associated algorithms for lightpath computation are outlined. We present and compare the performance of two different schemes for provisioning of the optical channels. The first scheme is a simple semi-dynamic constraint-based routing and wavelength assignment (RWA) algorithm that compute solutions to three sub-problems: (a) The routing problem; (b) The constraint-based shortest route selection problem; (c) The wavelength assignment problem. The second scheme is a more dynamic algorithm where both components, routing and wavelength assignment, are considered simultaneously. A new cost definition of optical links is introduced and two new path selections schemes are presented for the full-dynamic RWA. The performance of theses selections algorithms is compared by simulation.Key wordsIP/WDMRWALightpath Provisioning.
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.
