Exploring optimal solutions for planning optical networks with graph coloring techniques
Autor(a) principal: | |
---|---|
Data de Publicação: | 2021 |
Tipo de documento: | Dissertação |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10071/24243 |
Resumo: | Optical networks are crucial in today’s communications, so their planning is of paramount importance. Routing and Wavelength Assignment (WA) are essential planning functions to transport the data in these networks. This work aims to study different graph coloring techniques for WA in static optical networks. We analyze and compare different graph coloring algorithms such as the Greedy heuristic, an exact algorithm based on Integer Linear Programming (ILP) and the Tabu Search meta-heuristic, for WA in optical networks. The studies are performed considering several real network scenarios, different logical and path topologies, and the number of colors and computation time of each one of the studied algorithms is analysed. We have concluded that the exact algorithm based on ILP, although giving always the optimum number of colors, is only applicable to networks with less than 20 nodes, due to its higher computation time. It was also concluded that the Tabu Search algorithm gives always the same results as the exact algorithm, for the real networks studied, but in a much faster computation time. Finally, we have concluded that the common Greedy algorithm performs as well as the Tabu Search algorithm, for all the real networks studied, but in some scenarios, with random path matrices, the Tabu Search gives a lower number of colors than the Greedy algorithm. For example, the Tabu Search gives less 35 colors than the Greedy algorithm for a random path matrix with 1000 paths and a 50% probability that each path has one or more links being used by the other paths. |
id |
RCAP_35a2fe6624ba24b12d55ffc45dadac17 |
---|---|
oai_identifier_str |
oai:repositorio.iscte-iul.pt:10071/24243 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Exploring optimal solutions for planning optical networks with graph coloring techniquesGraph coloringGreedyProgramação linear inteira -- Integer linear programmingRede ótica -- Optical networkTabu SearchWavelength assignmentAtribuição de comprimentos de ondaColoração de grafosOptical networks are crucial in today’s communications, so their planning is of paramount importance. Routing and Wavelength Assignment (WA) are essential planning functions to transport the data in these networks. This work aims to study different graph coloring techniques for WA in static optical networks. We analyze and compare different graph coloring algorithms such as the Greedy heuristic, an exact algorithm based on Integer Linear Programming (ILP) and the Tabu Search meta-heuristic, for WA in optical networks. The studies are performed considering several real network scenarios, different logical and path topologies, and the number of colors and computation time of each one of the studied algorithms is analysed. We have concluded that the exact algorithm based on ILP, although giving always the optimum number of colors, is only applicable to networks with less than 20 nodes, due to its higher computation time. It was also concluded that the Tabu Search algorithm gives always the same results as the exact algorithm, for the real networks studied, but in a much faster computation time. Finally, we have concluded that the common Greedy algorithm performs as well as the Tabu Search algorithm, for all the real networks studied, but in some scenarios, with random path matrices, the Tabu Search gives a lower number of colors than the Greedy algorithm. For example, the Tabu Search gives less 35 colors than the Greedy algorithm for a random path matrix with 1000 paths and a 50% probability that each path has one or more links being used by the other paths.As redes óticas são fundamentais para as comunicações atuais, tendo o seu planeamento uma grande importância. O encaminhamento e a atribuição de comprimentos de onda são funções essenciais no planeamento do transporte de dados nestas redes. Este trabalho pretende estudar diferentes técnicas de coloração de grafos para a atribuição de comprimentos de onda nas redes óticas. Analisamos e comparamos diferentes algoritmos de atribuição de comprimentos de onda, como a heurística Greedy, um algoritmo exato baseado em Programação Linear Inteira (PLI) e um algoritmo de procura meta-heurístico, o Tabu Search. Estudaram-se estes algoritmos para diferentes redes reais, diferentes topologias lógicas e de caminhos, com o objetivo de analisar o número de cores e o tempo computacional obtidos por cada algoritmo estudado. Concluímos que o algoritmo exato baseado em PLI, embora devolva sempre um número de cores ótimo, aplica-se apenas a redes com menos de 20 nós, devido ao seu tempo computacional elevado. Também se concluiu que o Tabu Search devolve sempre os mesmos resultados que o algoritmo exato, para as redes reais, mas com mais rapidez computacional. Concluiu-se também para as redes reais, que o Greedy estima o mesmo número de cores que o Tabu Search. No entanto, com matrizes geradas aleatoriamente, nalguns casos, o Tabu Search retorna menos cores que o Greedy. Por exemplo, o Tabu Search devolve menos 35 cores que o Greedy para uma matriz de 1000 caminhos e 50% de probabilidade de cada caminho ter uma ou mais ligações pertencentes aos restantes caminhos.2022-01-21T15:24:49Z2021-12-17T00:00:00Z2021-12-172021-11info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfhttp://hdl.handle.net/10071/24243TID:202855279engGomes, Inês Ferreirainfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-11-09T17:58:51Zoai:repositorio.iscte-iul.pt:10071/24243Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T22:30:43.657992Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Exploring optimal solutions for planning optical networks with graph coloring techniques |
title |
Exploring optimal solutions for planning optical networks with graph coloring techniques |
spellingShingle |
Exploring optimal solutions for planning optical networks with graph coloring techniques Gomes, Inês Ferreira Graph coloring Greedy Programação linear inteira -- Integer linear programming Rede ótica -- Optical network Tabu Search Wavelength assignment Atribuição de comprimentos de onda Coloração de grafos |
title_short |
Exploring optimal solutions for planning optical networks with graph coloring techniques |
title_full |
Exploring optimal solutions for planning optical networks with graph coloring techniques |
title_fullStr |
Exploring optimal solutions for planning optical networks with graph coloring techniques |
title_full_unstemmed |
Exploring optimal solutions for planning optical networks with graph coloring techniques |
title_sort |
Exploring optimal solutions for planning optical networks with graph coloring techniques |
author |
Gomes, Inês Ferreira |
author_facet |
Gomes, Inês Ferreira |
author_role |
author |
dc.contributor.author.fl_str_mv |
Gomes, Inês Ferreira |
dc.subject.por.fl_str_mv |
Graph coloring Greedy Programação linear inteira -- Integer linear programming Rede ótica -- Optical network Tabu Search Wavelength assignment Atribuição de comprimentos de onda Coloração de grafos |
topic |
Graph coloring Greedy Programação linear inteira -- Integer linear programming Rede ótica -- Optical network Tabu Search Wavelength assignment Atribuição de comprimentos de onda Coloração de grafos |
description |
Optical networks are crucial in today’s communications, so their planning is of paramount importance. Routing and Wavelength Assignment (WA) are essential planning functions to transport the data in these networks. This work aims to study different graph coloring techniques for WA in static optical networks. We analyze and compare different graph coloring algorithms such as the Greedy heuristic, an exact algorithm based on Integer Linear Programming (ILP) and the Tabu Search meta-heuristic, for WA in optical networks. The studies are performed considering several real network scenarios, different logical and path topologies, and the number of colors and computation time of each one of the studied algorithms is analysed. We have concluded that the exact algorithm based on ILP, although giving always the optimum number of colors, is only applicable to networks with less than 20 nodes, due to its higher computation time. It was also concluded that the Tabu Search algorithm gives always the same results as the exact algorithm, for the real networks studied, but in a much faster computation time. Finally, we have concluded that the common Greedy algorithm performs as well as the Tabu Search algorithm, for all the real networks studied, but in some scenarios, with random path matrices, the Tabu Search gives a lower number of colors than the Greedy algorithm. For example, the Tabu Search gives less 35 colors than the Greedy algorithm for a random path matrix with 1000 paths and a 50% probability that each path has one or more links being used by the other paths. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021-12-17T00:00:00Z 2021-12-17 2021-11 2022-01-21T15:24:49Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/masterThesis |
format |
masterThesis |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10071/24243 TID:202855279 |
url |
http://hdl.handle.net/10071/24243 |
identifier_str_mv |
TID:202855279 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799134869467430912 |