Please use this identifier to cite or link to this item:
Author(s): Duarte, I.
Cancela, L.
Rebola, J.
Date: 2021
Title: Graph coloring heuristics for optical networks planning
Event title: 2021 Telecoms Conference, ConfTELE 2021
ISBN: 978-1-6654-1588-0
DOI (Digital Object Identifier): 10.1109/ConfTELE50222.2021.9435591
Keywords: DSATUR
Graph coloring
Optical networks
Wavelength assignment
Abstract: This work focuses on the study of wavelength assignment algorithms based on Graph Coloring techniques. We analyze the performance of the Greedy heuristic, a well-known Graph Coloring heuristic, as well as the Degree of Saturation (DSATUR) and the Recursive Largest First (RLF) heuristics, for planning optical networks. These last two heuristics, to the best of our knowledge, have not yet been applied in the context of optical networks. Extensive simulations have been performed, using real network topologies under a static traffic scenario and we have concluded that the DSATUR and RLF heuristics can outperform the Greedy heuristic in network scenarios where there are several network clusters interconnected by only one or two links. In these cases, the RLF and DSATUR heuristics can provide less 9 and 5 wavelengths, respectively, than the Greedy heuristic, in networks with 34 nodes.
Peerreviewed: yes
Access type: Open Access
Appears in Collections:IT-CRI - Comunicações a conferências internacionais

Files in This Item:
File Description SizeFormat 
conferenceobject_79901.pdfVersão Aceite332,4 kBAdobe PDFView/Open

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

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