Please use this identifier to cite or link to this item:
Title: Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach
Authors: Gomes, Teresa
Jorge, Luísa
Melo, Paulo
Girão-Silva, Rita
Keywords: min-sum
SLRG maximally disjoint
Issue Date: 2016
Publisher: Springer US
Abstract: 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.
Description: Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach
Peer review: yes
DOI: 10.1007/s11107-015-0524-0
ISSN: 1387-974X
Publisher Version:
Appears in Collections:I&D INESCC - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat 
PNET-D-14-00118_EstudoGeral.pdf794.86 kBAdobe PDFView/Open

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.