TSCP: a tabu search algorithm for wavelength converting node placement in WDM optical networks

Simple item page
dc.citation.epage369en_US
dc.citation.spage359en_US
dc.citation.volumeNumber2005en_US
dc.contributor.authorŞengezer, Namıken_US
dc.contributor.authorKarasan, Ezhanen_US
dc.coverage.spatialMilan, Italyen_US
dc.date.accessioned2016-02-08T11:50:40Z
dc.date.available2016-02-08T11:50:40Z
dc.date.issued2005en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 7-9 February 2005en_US
dc.descriptionConference Name: Conference on Optical Network Design and Modeling, IEEE 2005en_US
dc.description.abstractSparse wavelength conversion can increase the performance of all-optical wavelength division multiplexing (WDM) networks signi cantly by relaxing the wavelength continuity constraint. In this paper, we study the wavelength converter placement problem in multi- ber networks with static traf c demands. We present a tabu search based heuristic algorithm. The objective of the algorithm is to satisfy all the traf c demands with the minimum total cost of bers achieved in the full conversion case, by placing minimum number of wavelength converting nodes. We also implement a greedy algorithm and compare the performances of these converter placement algorithms with the optimum solutions on a sample network. The Tabu search based algorithm achieves the optimum solution in 72% of the test cases and it increases the average number of wavelength converting nodes by less than 10% with respect to the optimum solution. The effect of the utilized routing scheme on the generated solutions and the correlation between the converter node locations and the amount of traf c passing through the nodes are also investigated.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T11:50:40Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2005en
dc.identifier.doi10.1109/ONDM.2005.1427018en_US
dc.identifier.urihttp://hdl.handle.net/11693/27326
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ONDM.2005.1427018en_US
dc.source.titleProceedings of the Conference on Optical Network Design and Modeling, IEEE 2005en_US
dc.subjectGreedy algorithmsen_US
dc.subjectOptical networksen_US
dc.subjectWavelength convertersen_US
dc.subjectAlgorithmsen_US
dc.subjectConstraint theoryen_US
dc.subjectHeuristic methodsen_US
dc.subjectOptical communicationen_US
dc.subjectProblem solvingen_US
dc.subjectTelecommunication trafficen_US
dc.subjectWavelength division multiplexingen_US
dc.titleTSCP: a tabu search algorithm for wavelength converting node placement in WDM optical networksen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TSCP A tabu search algorithm for wavelength converting node placement in WDM optical networks.pdf
Size:
1.71 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering