Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBarpanda, R S-
dc.contributor.authorTuruk, A K-
dc.contributor.authorSahoo, Bibhudatta-
dc.identifier.citationProceedings of International Conference on Challenges and Applications of Mathematics in Sciences and Technology, January 11-13, 2010, Pages 47-57en
dc.description.abstractThis paper focuses on Integer Linear Programming formulations for the Routing and Wavelength Assignment problem in Wavelength Division Multiplexed optical networks where end-users communicate with each other by establishing all optical WDM channels which are referred to 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, Approximation schemes and Heuristic approaches can be applied to solve the RWA problem. In this work, we propose new ILP formulations by imposing additional constraints to the objective function, thus establishing lightpaths which are immune to signal distortion and crosstalk. After modeling the RWA problem as an optimization problem, we focus on applying Soft Computing techniques like Genetic Algorithms to find a sub-optimal solution for the RWA problem.en
dc.format.extent94117 bytes-
dc.subjectInteger Linear Programming;en
dc.subjectRouting and Wavelength Assignment;en
dc.subjectWavelength Division Multiplexing;en
dc.subjectGenetic Algorithmsen
dc.titleSoft Computing Techniques to Solve the RWA Problem in WDM Optical Networks with ILP Formulationsen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
CAMIST1.pdf91.91 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.