Please use this identifier to cite or link to this item: http://10.1.7.192:80/jspui/handle/123456789/1379
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKothari, D. K.-
dc.contributor.authorMahajan, S.-
dc.contributor.authorTiwari, S.-
dc.date.accessioned2009-11-17T09:47:17Z-
dc.date.available2009-11-17T09:47:17Z-
dc.date.issued2007-01-26-
dc.identifier.citationThirteenth National Conference on Communications, IIT Kanpur (NCC'07), Jan. 26-28, 2007en
dc.identifier.urihttp://hdl.handle.net/123456789/1379-
dc.descriptionNCC-2007, Page No. 116-120en
dc.description.abstractWe propose a novel WDM aware weight function for solving the Routing and Wavelength Assignment (RWA) problem in optical WDM networks taking into consideration factors like number of used wavelengths , availability of free wavelengths and route length jointly under dynamic traffic conditions. The performance of proposed routing strategy is studied in combination with first-fit, and most used wavelength heuristics using simulation with and without wavelength continuity constraint. Firstly we demonstrate that the recently proposed weighted least congested routing algorithm with first-fit wavelength assignment (WLCR-FF) if instead used with most used wavelength assignment, gives better blocking performance. We further compare the performance of new weight function with most used wavelength assignment with systems employing WLCR-FF and FAR-FF algorithms for ring and mesh networks. The results show that the routing based on proposed weight function together with most used wavelength assignment achieve better performance in terms of blocking probability.en
dc.language.isoen_USen
dc.subjectEC Faculty Paperen
dc.subjectFaculty Paperen
dc.subjectITFEC003en
dc.titleDynamic Routing and Wavelength Assignment using Adaptive Weight Function for All - Optical WDM Networksen
dc.typeFaculty Papersen
Appears in Collections:Faculty Papers, EC

Files in This Item:
File Description SizeFormat 
ITFEC003-1.pdfITFEC003-1165.43 kBAdobe PDFThumbnail
View/Open


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