Please use this identifier to cite or link to this item:
http://hdl.handle.net/10071/25699
Author(s): | Gomes, I. Cancela, L. Rebola, J. |
Editor: | de Ceglia, D., Raposo, M., Albella, P., & Ribeiro, P. |
Date: | 2022 |
Title: | Exploring the tabu search algorithm as a graph coloring technique for wavelength assignment in optical networks |
Pages: | 59 - 68 |
Event title: | 10th International Conference on Photonics, Optics and Laser Technology (PHOTOPTICS 2022) |
ISSN: | 2184-4364 |
ISBN: | 978-989-758-554-8 |
DOI (Digital Object Identifier): | 10.5220/0010910000003121 |
Keywords: | Graph coloring Greedy Optical networks Tabu search Wavelength assignment |
Abstract: | The aim of this work is to study the Tabu Search algorithm as a graph coloring technique for wavelength assignment in optical networks, a crucial function in optical network planning. The performance of the Tabu Search is assessed in terms of the number of wavelengths and computation time and is compared with the one of the most common Greedy algorithm. It is concluded that for real networks with a large number of nodes and a higher variance node degree of the path graph relatively to its average node degree value, the Greedy algorithm is preferable to the Tabu Search algorithm since it returns the same number of colors of Tabu Search, but in a shorter computation time. |
Peerreviewed: | yes |
Access type: | Open Access |
Appears in Collections: | IT-CRI - Comunicações a conferências internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
conferenceObject_87919.pdf | Versão Aceite | 551,07 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.