Publicação
Dimensioning and optimization in optical transport networks
| Resumo: | In this dissertation a study is presented on the design and optimization of optical transport networks taking into account several specific aspects and certain restrictions. First, the physical topology of the network used for this study is defined by determine its nodes and their connections. For a more detailed analysis and for a wide variety of results, three different amounts of traffic injected into the network are taken into account where it is necessary to consider how this traffic is aggregated. Traffic routing is based on different logical topologies (opaque, transparent and translucent). In this thesis the main factor in question is the CAPEX of the network and for this are created linear programming models based on constraints and objective functions with the purpose of minimizing this value guaranteeing the total traffic routing. The results of these models are described in detail throughout the dissertation. The analytical calculations of this process are also considered. With these results and taking into account algorithms of aggregation and routing based on heuristics developed in a previous dissertation the comparison of results is made. Finally, all the conclusions are presented. |
|---|---|
| Autores principais: | Esteves, Tiago Duarte |
| Assunto: | CAPEX Physical topology Optical topology Optical channels Opaque mode Transparent mode Translucent mode Analytical model Integer linear programming |
| Ano: | 2018 |
| País: | Portugal |
| Tipo de documento: | dissertação de mestrado |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade de Aveiro |
| Idioma: | inglês |
| Origem: | RIA - Repositório Institucional da Universidade de Aveiro |
| Resumo: | In this dissertation a study is presented on the design and optimization of optical transport networks taking into account several specific aspects and certain restrictions. First, the physical topology of the network used for this study is defined by determine its nodes and their connections. For a more detailed analysis and for a wide variety of results, three different amounts of traffic injected into the network are taken into account where it is necessary to consider how this traffic is aggregated. Traffic routing is based on different logical topologies (opaque, transparent and translucent). In this thesis the main factor in question is the CAPEX of the network and for this are created linear programming models based on constraints and objective functions with the purpose of minimizing this value guaranteeing the total traffic routing. The results of these models are described in detail throughout the dissertation. The analytical calculations of this process are also considered. With these results and taking into account algorithms of aggregation and routing based on heuristics developed in a previous dissertation the comparison of results is made. Finally, all the conclusions are presented. |
|---|
Atividades financiadas
Não foram encontrados projetos financiados.