DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1481

Title: Genetic Algorithm techniques to solve Routing and Wavelength Assignment problem in Wavelength Division Multiplexing all-optical networks
Authors: Barpanda, R S
Turuk, A K
Sahoo, Bibhudatta
Majhi, B
Keywords: Routing and Wavelength Assignment
Wavelength Division Multiplexing
Lightpath
Integer Linear Programming
Genetic Algorithm
Issue Date: Jan-2011
Publisher: IEEE
Citation: Third International Conference on Communication Systems and Networks (COMSNETS 2011), Bangalore, 2011
Abstract: Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexed (WDM) optical networks assumes assigning the routes and wavelengths to be used to create the lightpaths on behalf of the connection requests. The RWA problem belongs to the class of combinatorial optimization problems. The optimal solution to the RWA problem is found to be NP-hard and thus suited to heuristic approaches. We formulate an Integer Linear Programming (ILP) problem to model the RWA problem as an optimization problem and solve the formulated ILP using Genetic Algorithm (GA) heuristic to obtain a near optimal solution in polynomial time. Our primary optimization objective is the establishment of connection requests with minimum congestion among the individuals. The secondary targets are to minimize the hop count, route length, the number of fiber links utilized to honor all the lightpath requests. The GA based heuristic approach is simulated on ARPANET (Advanced Research Project Agency NETwork)...
Description: Copyright for this article belongs to IEEE
URI: http://doi.dx.org/10.1109/COMSNETS.2011.5716507
http://hdl.handle.net/2080/1481
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
IAMCOM-2011.pdf168KbAdobe PDFView/Open

Show full item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback