Publication
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach
| dc.contributor.author | Gomes, Teresa | |
| dc.contributor.author | Jorge, Luísa | |
| dc.contributor.author | Melo, Paulo | |
| dc.contributor.author | Girão-Silva, Rita | |
| dc.date.accessioned | 2018-01-31T10:00:00Z | |
| dc.date.accessioned | 2018-02-01T09:37:57Z | |
| dc.date.available | 2018-01-31T10:00:00Z | |
| dc.date.available | 2018-02-01T09:37:57Z | |
| dc.date.issued | 2016 | |
| dc.description.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 Multi-protocol Label Switching control plane. | en_EN |
| dc.description.sponsorship | We thank Sérgio Mendes for implementing part of the code used in this work. The authors acknowledge financial support through project QREN 23301 PANORAMA II, co-financed by European Union’s FEDER through “Programa Operacional Factores de Competitividade” (POFC) of QREN (FCOMP-01-0202-FEDER-023301), by the Portuguese Foundation for Science and Technology under project grant UID/MULTI/00308/2013 and by PT Inovação R&D Project “End to End Protection considering SRLGs-II”. | |
| dc.description.version | info:eu-repo/semantics/publishedVersion | en_EN |
| dc.identifier.citation | Gomes, Teresa; Jorge, Luísa; Melo, Paulo; Girão-Silva, Rita (2016). Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach. Photonic Network Communications. ISSN 1387-974X. 31, p. 11-22 | en_EN |
| dc.identifier.doi | 10.1007/s11107-015-0524-0 | en_EN |
| dc.identifier.issn | 1387-974X | |
| dc.identifier.uri | http://hdl.handle.net/10198/15397 | |
| dc.language.iso | eng | |
| dc.peerreviewed | yes | en_EN |
| dc.subject | Min-sum | en_EN |
| dc.subject | Multi-objective | en_EN |
| dc.subject | SRLG maximally disjoint | en_EN |
| dc.title | Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach | en_EN |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.awardURI | info:eu-repo/grantAgreement/FCT/5876/UID%2FMulti%2F00308%2F2013/PT | |
| oaire.fundingStream | 5876 | |
| person.familyName | Jorge | |
| person.givenName | Luísa | |
| person.identifier.ciencia-id | AB16-0263-87CB | |
| person.identifier.orcid | 0000-0002-0623-7282 | |
| person.identifier.rid | F-5156-2014 | |
| person.identifier.scopus-author-id | 22134881600 | |
| project.funder.identifier | http://doi.org/10.13039/501100001871 | |
| project.funder.name | Fundação para a Ciência e a Tecnologia | |
| rcaap.rights | openAccess | en_EN |
| rcaap.type | article | en_EN |
| relation.isAuthorOfPublication | 103e1f8c-bbdc-4ea3-a014-7b3b69ae5a00 | |
| relation.isAuthorOfPublication.latestForDiscovery | 103e1f8c-bbdc-4ea3-a014-7b3b69ae5a00 | |
| relation.isProjectOfPublication | 9ec884a6-5708-4590-8d1a-09240026a690 | |
| relation.isProjectOfPublication.latestForDiscovery | 9ec884a6-5708-4590-8d1a-09240026a690 |