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

Full metadata record

DC FieldValueLanguage
contributor.authorBarpanda, R S-
contributor.authorTuruk, A K-
contributor.authorSahoo, Bibhudatta-
contributor.authorMajhi, B-
date.accessioned2011-07-07T08:58:29Z-
date.available2011-07-07T08:58:29Z-
date.issued2011-
identifier.citationS. Unnikrishnan, S. Surve, and D. Bhoir (Eds.): ICAC3 2011, CCIS 125, pp. 137–142, 2011.en
identifier.urihttp://hdl.handle.net/2080/1480-
descriptionCopyright for this article belong to Springer-Verlagen
description.abstractThis research work presents a Genetic Algorithm (GA) heuristic approach to solve the static Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexing (WDM) networks under wavelength continuity constraint. The RWA problem is modeled as an Integer Linear Programming (ILP) problem with the optimization objective to balance the network load among the connection requests. We consider ARPANET as the standard simulation network and use Genetic Algorithm technique to solve the formulated ILP on such network to produce a near optimal solution in polynomial time. We state three different fitness functions, all of them aim at balancing the network load among individuals and compare them while optimizing different network parameters.en
format.extent130935 bytes-
format.mimetypeapplication/pdf-
language.isoen-
publisherSpringer-Verlag Berlin Heidelbergen
subjectGenetic Algorithmen
subjectRWA problemen
subjectWDM networken
subjectwavelength continuity constrainten
subjectInteger Linear Programmingen
subjectfitness functionen
titleA Genetic Algorithm Way of Solving RWA Problem in All Optical WDM Networksen
typeArticleen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
ICAC3-2011.pdf127KbAdobe PDFView/Open

Show simple item record

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

 

Powered by DSpace Feedback