Abstract
In wavelength-routed optical networks, wavelength converters are considered as one of the most critical network resources. Unfortunately, previous wavelength assignment algorithms have seldom considered their presence. Therefore, in this paper, we propose a novel dynamic algorithm that can minimize the number of wavelength translations required for each lightpath. Our algorithm establishes a lightpath by chaining a minimum number of wavelength-continuous segments, called lambda-runs. The simulations show that our algorithm performs as well as the existing optimal algorithm while it is very scalable and easy to implement.
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.
