Abstract
The static routing and wavelength assignment (RWA) problem for wavelength routing optical networks has traditionally been solved using Integer Linear Programming (ILP) and graph colouring. These problem domain search schemes become inefficient for solving large NP-hard (Non Polynomial Time - hard) optimization problems and in dynamic environments because of their computational complexity and execution time. In this paper, a heuristic approach inspired by Particle Swarm Optimization (PSO) is proposed for solving static RWA. A new encoding scheme for members of the swarm population is proposed. To help the particles to converge towards an optimal solution quickly, a novel scheme is devised for route selection, during particle's search. In order to diversify the search in problem space, a special operation is proposed for the global best particle. The proposed scheme achieves a good solution in a significantly lower number of iterations as compared to other heuristic algorithms.
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.
