Development of heuristics for transparent optical networks dimensioning
Autor(a) principal: | |
---|---|
Data de Publicação: | 2019 |
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/10773/29567 |
Resumo: | In this dissertation a set of heuristic algorithms was developed, implemented and validated for the dimensioning of transparent optical networks. A generic platform was also created in order to allow the heuristics development and implementation, based on two main entities: a logical layer manager and a physical layer manager. The referred structure was designed in order to allow the test of a vast variety of heuristic algorithms. Within the scope of this dissertation were developed traffic scheduling algorithms based on the individual traffic quantity of each request. In addition, some routing, grooming and wavelength assignment algorithms were also developed. The main goal of these heuristics is is to dimension networks, while recurring to the minimum possible amount of resources, thus minimizing the CAPEX of the network, while also trying to guarantee the total traffic routing. For simplicity reasons only the case of networks without survivabilty was treated, although the platform is sufficiently generic to allow its inclusion in future work. Regarding the economic aspects, a detailed and comparative study was conducted, focusing on the networks CAPEX, in order to validate and assess the quality of the solutions provided by the heuristics developed based on the solutions given by an integer linear programming model. Finally, some conclusions and possible future work are discussed. |
id |
RCAP_e7168b4502cb26224c0efe2eac04574f |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/29567 |
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 |
Development of heuristics for transparent optical networks dimensioningCAPEXHeuristicsTransparent optical networksLogical layerPhysical layerAlgorithmsSchedulingRoutingGroomingSurvivabilityInteger linear programmingIn this dissertation a set of heuristic algorithms was developed, implemented and validated for the dimensioning of transparent optical networks. A generic platform was also created in order to allow the heuristics development and implementation, based on two main entities: a logical layer manager and a physical layer manager. The referred structure was designed in order to allow the test of a vast variety of heuristic algorithms. Within the scope of this dissertation were developed traffic scheduling algorithms based on the individual traffic quantity of each request. In addition, some routing, grooming and wavelength assignment algorithms were also developed. The main goal of these heuristics is is to dimension networks, while recurring to the minimum possible amount of resources, thus minimizing the CAPEX of the network, while also trying to guarantee the total traffic routing. For simplicity reasons only the case of networks without survivabilty was treated, although the platform is sufficiently generic to allow its inclusion in future work. Regarding the economic aspects, a detailed and comparative study was conducted, focusing on the networks CAPEX, in order to validate and assess the quality of the solutions provided by the heuristics developed based on the solutions given by an integer linear programming model. Finally, some conclusions and possible future work are discussed.Nesta dissertação foram desenvolvidas, implementadas e validadas heurísticas para o dimensionamento de redes óticas de transporte transparentes. Foi criada uma plataforma genérica para o desenvolvimento e a implementação das heurísticas baseada em duas entidades principais: um gestor de recursos da camada lógica e um gestor de recursos da camada física. Esta estrutura foi desenhada de modo a poder ser usada para testar uma grande variedade de heurísticas. No âmbito desta tese foram desenvolvidas heuristicas considerando o escalonamento dos pedidos baseados na quantidade de tráfego de cada pedido. Foram ainda desenvolvidos algoritmos para o encaminhamento, a atribuição de comprimentos de onda e agregação dos pedidos de tráfego. O objetivo das heurísticas passa pelo dimensionamento de uma rede, onde recorrendo-se a um mínimo possível de recursos, e portanto, minimizando o CAPEX da rede, se tenta garantir o encaminhamento total do tráfego. Por uma questão de simplificidade apenas foram consideradas redes sem sobrevivência, no entanto, a plataforma é suficientemente genérica para permitir a inclusão de sobrevivência. Tendo também em conta a referida vertente económica, foi elaborado um estudo detalhado e comparativo, tendo em foco o CAPEX da rede, com o objetivo de validar a qualidade das soluções fornecidas pelas heurísticas desenvolvidas tendo por base os valores obtidos através de um modelo baseado em programação linear inteira. Finalmente, são partilhadas e discutidas algumas conclusões e direções para o desenvolvimento de trabalho futuro.2020-10-22T15:32:15Z2019-07-01T00:00:00Z2019-07info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfhttp://hdl.handle.net/10773/29567engFernandes, Eduardo José Dominguesinfo: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:RCAAP2024-02-22T11:57:13Zoai:ria.ua.pt:10773/29567Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:01:52.621364Repositó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 |
Development of heuristics for transparent optical networks dimensioning |
title |
Development of heuristics for transparent optical networks dimensioning |
spellingShingle |
Development of heuristics for transparent optical networks dimensioning Fernandes, Eduardo José Domingues CAPEX Heuristics Transparent optical networks Logical layer Physical layer Algorithms Scheduling Routing Grooming Survivability Integer linear programming |
title_short |
Development of heuristics for transparent optical networks dimensioning |
title_full |
Development of heuristics for transparent optical networks dimensioning |
title_fullStr |
Development of heuristics for transparent optical networks dimensioning |
title_full_unstemmed |
Development of heuristics for transparent optical networks dimensioning |
title_sort |
Development of heuristics for transparent optical networks dimensioning |
author |
Fernandes, Eduardo José Domingues |
author_facet |
Fernandes, Eduardo José Domingues |
author_role |
author |
dc.contributor.author.fl_str_mv |
Fernandes, Eduardo José Domingues |
dc.subject.por.fl_str_mv |
CAPEX Heuristics Transparent optical networks Logical layer Physical layer Algorithms Scheduling Routing Grooming Survivability Integer linear programming |
topic |
CAPEX Heuristics Transparent optical networks Logical layer Physical layer Algorithms Scheduling Routing Grooming Survivability Integer linear programming |
description |
In this dissertation a set of heuristic algorithms was developed, implemented and validated for the dimensioning of transparent optical networks. A generic platform was also created in order to allow the heuristics development and implementation, based on two main entities: a logical layer manager and a physical layer manager. The referred structure was designed in order to allow the test of a vast variety of heuristic algorithms. Within the scope of this dissertation were developed traffic scheduling algorithms based on the individual traffic quantity of each request. In addition, some routing, grooming and wavelength assignment algorithms were also developed. The main goal of these heuristics is is to dimension networks, while recurring to the minimum possible amount of resources, thus minimizing the CAPEX of the network, while also trying to guarantee the total traffic routing. For simplicity reasons only the case of networks without survivabilty was treated, although the platform is sufficiently generic to allow its inclusion in future work. Regarding the economic aspects, a detailed and comparative study was conducted, focusing on the networks CAPEX, in order to validate and assess the quality of the solutions provided by the heuristics developed based on the solutions given by an integer linear programming model. Finally, some conclusions and possible future work are discussed. |
publishDate |
2019 |
dc.date.none.fl_str_mv |
2019-07-01T00:00:00Z 2019-07 2020-10-22T15:32:15Z |
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/10773/29567 |
url |
http://hdl.handle.net/10773/29567 |
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_ |
1799137674567614464 |