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/1175

Full metadata record

DC FieldValueLanguage
contributor.authorBarpanda, R S-
contributor.authorTuruk, A K-
contributor.authorSahoo, Bibhudatta-
date.accessioned2010-02-10T09:47:50Z-
date.available2010-02-10T09:47:50Z-
date.issued2009-12-
identifier.citationIEEE Conference Proceedings of World Congress on Nature & Biologically Inspired Computing, 9-11 December. 2009, pages: 1297-1302.en
identifier.urihttp://hdl.handle.net/2080/1175-
description.abstractRouting and Wavelength Assignment Problem in wavelength division multiplexed optical network is represented as an Integer Linear Program which is found to be NP-Complete. Our attention is devoted to such networks operating under wavelength continuity constraint, in which a lightpath must occupy the same wavelength on all the links it traverses. In setting up a lightpath, a route must be selected and a wavelength must be assigned to the lightpath. We have proposed ILP formulations for MaxRWA and MinRWA problems with a new cost function. The cost function is based on congestion with delay and hop-count is of secondary importance. Genetic Algorithms provide an attractive approach to compute sub-optimal solutions for the RWA problem. This paper discusses a genetic algorithm way of solving the RWA problem on standard networks such as ARPANET.en
format.extent482092 bytes-
format.mimetypeapplication/pdf-
language.isoen-
publisherIEEEen
subjectGenetic Algorithm;en
subjectInteger Linear Program;en
subjectRouting and Wavelength Assignment;en
subjectWDM Networks;en
subjectWavelength Continuity Constraint;en
subjectWavelength Continuity Constraint;en
titleA New Cost Function to Solve RWA Problem in Wavelength Routed Optical Network using Genetic Algorithmsen
typeArticleen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
IEEEXplore.pdf470KbAdobe PDFView/Open

Show simple item record

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

 

Powered by DSpace Feedback