Detalhes do Documento

Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

Autor(es): Gomes, Teresa ; Jorge, Luísa ; Melo, Paulo ; Girão-Silva, Rita

Data: 2016

Identificador Persistente: https://hdl.handle.net/10316/48331

Origem: Estudo Geral - Universidade de Coimbra

Assunto(s): min-sum; SLRG maximally disjoint; multi-objective


Descrição

Path protection is a fast and capacity efficient approach for increasing the availability of end-to-end connections. However, sometimes it is not possible to obtain a fully disjoint path pair. In this case it may be admissible to consider a path pair which is as disjoint as possible, and thus provide the best (in a certain sense) level of the single fault protection that can be ensured using this type of approach. A Shared Risk Link Group (SRLG) is a group of links which have a common risk of failure. Two new heuristics for solving the min-sum maximally node and SRLG-disjoint path pair are presented. The relative performance of the new heuristics and also of two other previously proposed heuristics, is evaluated using four different networks. Results, regarding accuracy and execution time of the studied heuristics, show that one of the new proposed algorithms can be a good compromise for use in the Generalized Multiprotocol Label Switching (GMPLS) control plane.

Tipo de Documento Artigo científico
Idioma Inglês
Contribuidor(es) Estudo Geral
facebook logo  linkedin logo  twitter logo 
mendeley logo

Documentos Relacionados