Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach
Autor(a) principal: | |
---|---|
Data de Publicação: | 2016 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10316/48331 https://doi.org/10.1007/s11107-015-0524-0 |
Resumo: | Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach |
id |
RCAP_834a280446e31c8f515db4b00d799df8 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/48331 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approachmin-sumSLRG maximally disjointmulti-objectiveMaximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approachPath 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.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”.Springer US2016info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/48331http://hdl.handle.net/10316/48331https://doi.org/10.1007/s11107-015-0524-0eng1387-974Xhttps://link.springer.com/article/10.1007/s11107-015-0524-0Gomes, TeresaJorge, LuísaMelo, PauloGirão-Silva, Ritainfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2020-06-29T13:21:14Zoai:estudogeral.uc.pt:10316/48331Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:53:43.937263Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach |
title |
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach |
spellingShingle |
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach Gomes, Teresa min-sum SLRG maximally disjoint multi-objective |
title_short |
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach |
title_full |
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach |
title_fullStr |
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach |
title_full_unstemmed |
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach |
title_sort |
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach |
author |
Gomes, Teresa |
author_facet |
Gomes, Teresa Jorge, Luísa Melo, Paulo Girão-Silva, Rita |
author_role |
author |
author2 |
Jorge, Luísa Melo, Paulo Girão-Silva, Rita |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Gomes, Teresa Jorge, Luísa Melo, Paulo Girão-Silva, Rita |
dc.subject.por.fl_str_mv |
min-sum SLRG maximally disjoint multi-objective |
topic |
min-sum SLRG maximally disjoint multi-objective |
description |
Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach |
publishDate |
2016 |
dc.date.none.fl_str_mv |
2016 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10316/48331 http://hdl.handle.net/10316/48331 https://doi.org/10.1007/s11107-015-0524-0 |
url |
http://hdl.handle.net/10316/48331 https://doi.org/10.1007/s11107-015-0524-0 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
1387-974X https://link.springer.com/article/10.1007/s11107-015-0524-0 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Springer US |
publisher.none.fl_str_mv |
Springer US |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799133823743557632 |