Abstract
We study routing and wavelength assignment (RWA) tasks in WDM mesh networks with wavelength conversion capabilities. For each lightpath request, we solve the routing and wavelength assignment sub-problems as a single problem, rather than separating them into two separate problems. We use four different optimization criteria: (1) minimum number of wavelength conversions; (2) minimum number of wavelengths used; (3) minimum hop count; (4) minimum use of scarce resources (trunking). Each of these problems is solved by a Dijkstra type of algorithm, executed sequentially on one request at a time. We also develop an integer linear programming (ILP) model with the objective of minimizing the number of wavelength conversions. The optimal ILP solution can only be obtained for small networks. We conduct a comprehensive simulation study of the performance of the algorithms for different network topologies and traffic scenarios.
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.
