By Topic

Solving large problem instances of the RWA problem using Genetic Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ravi Sankar Barpanda ; Department of Computer Science & Engineering, National Institute of Technology, Rourkela, India ; Bibhudatta Sahoo ; Ashok Kumar Turuk ; Banshidhar Majhi

This research work focuses on Integer Linear Programming (ILP) formulations for the Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexed (WDM) networks where end-users communicate with each other by establishing all-optical, non-interfering wavelength channels which are referred as lightpaths. The RWA problem is reducible to Graph Coloring problem in polynomial time and hence found to be NP-Complete. So, Soft Computing techniques along with Heuristic methods are applicable to solve large instances of the RWA problem. In this work, we propose new ILP formulations by imposing additional constraints to the objective function, thereby, establishing lightpaths which are immune to signal distortion and crosstalk. Furthermore, we develop constraints to make the lightpaths avoid creating loops while traversing between the Source-Destination node pair. After modeling the RWA problem as an Optimization problem, we focus on applying Genetic Algorithms (GA) to find a sub-optimal solution for the RWA problem.

Published in:

2010 5th International Conference on Industrial and Information Systems

Date of Conference:

July 29 2010-Aug. 1 2010