Publicação
Implementation of geographic diversity in resilient telecommunication networks
| Resumo: | In the K D-geodiverse shortest paths problem we intend to determine K paths with the minimum total cost between two nodes of a network, such that the distance between the internal elements of each pair of the K paths exceeds a given value D > 0. Internal elements of a path are all the nodes and arcs that constitute it, except the first and the last nodes as well as the arcs incident on those nodes. This problem models disaster situations that affect a geographic zone with an impact radius D, guaranteeing the connection between the first and the last nodes, provided that such an event affects, at most, K - 1 of these paths. In particular, geodiverse protection mechanisms are used to ensure the resilience of telecommunications networks. We extend the application of geodiversification found in past literature for K = 2, and find K > 2 paths between a source and a destination nodes with the minimum total cost for a given distance value D, through an Integer Linear Programming formulation. Computational results of the proposed model are presented when applied to two reference networks in telecommunications. |
|---|---|
| Autores principais: | Godinho, Maria |
| Outros Autores: | Pascoal, Marta |
| Assunto: | Telecommunications routing Geodiversity Integer linear programming DISJOINT PATHS |
| Ano: | 2023 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Instituto Politécnico de Beja |
| Idioma: | inglês |
| Origem: | Repositório Institucional do IPBeja |
| Resumo: | In the K D-geodiverse shortest paths problem we intend to determine K paths with the minimum total cost between two nodes of a network, such that the distance between the internal elements of each pair of the K paths exceeds a given value D > 0. Internal elements of a path are all the nodes and arcs that constitute it, except the first and the last nodes as well as the arcs incident on those nodes. This problem models disaster situations that affect a geographic zone with an impact radius D, guaranteeing the connection between the first and the last nodes, provided that such an event affects, at most, K - 1 of these paths. In particular, geodiverse protection mechanisms are used to ensure the resilience of telecommunications networks. We extend the application of geodiversification found in past literature for K = 2, and find K > 2 paths between a source and a destination nodes with the minimum total cost for a given distance value D, through an Integer Linear Programming formulation. Computational results of the proposed model are presented when applied to two reference networks in telecommunications. |
|---|