TSCP: a tabu search algorithm for wavelength converting node placement in WDM optical networks
dc.citation.epage | 369 | en_US |
dc.citation.spage | 359 | en_US |
dc.citation.volumeNumber | 2005 | en_US |
dc.contributor.author | Şengezer, Namık | en_US |
dc.contributor.author | Karasan, Ezhan | en_US |
dc.coverage.spatial | Milan, Italy | en_US |
dc.date.accessioned | 2016-02-08T11:50:40Z | |
dc.date.available | 2016-02-08T11:50:40Z | |
dc.date.issued | 2005 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 7-9 February 2005 | en_US |
dc.description | Conference Name: Conference on Optical Network Design and Modeling, IEEE 2005 | en_US |
dc.description.abstract | Sparse 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.provenance | Made 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: 2005 | en |
dc.identifier.doi | 10.1109/ONDM.2005.1427018 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/27326 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/ONDM.2005.1427018 | en_US |
dc.source.title | Proceedings of the Conference on Optical Network Design and Modeling, IEEE 2005 | en_US |
dc.subject | Greedy algorithms | en_US |
dc.subject | Optical networks | en_US |
dc.subject | Wavelength converters | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Constraint theory | en_US |
dc.subject | Heuristic methods | en_US |
dc.subject | Optical communication | en_US |
dc.subject | Problem solving | en_US |
dc.subject | Telecommunication traffic | en_US |
dc.subject | Wavelength division multiplexing | en_US |
dc.title | TSCP: a tabu search algorithm for wavelength converting node placement in WDM optical networks | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- 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