Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks

Detalhes bibliográficos
Autor(a) principal: Gomes, Teresa
Data de Publicação: 2007
Outros Autores: Craveirinha, José
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/4054
https://doi.org/10.1016/j.ejor.2006.03.005
Resumo: In transmission networks an important routing problem is to find a pair of link disjoint paths which optimises some performance measure. In this paper the problem of obtaining the most reliable pair of link disjoint paths, assuming the reliability of the links are known, is considered. This is a non-linear optimisation problem. It is further introduced the constraint that the length of the paths should not exceed a certain number of links, which makes the efficient resolution of the problem more complex.
id RCAP_0baf7e009d1bfee850c051cd74da7fd1
oai_identifier_str oai:estudogeral.uc.pt:10316/4054
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 Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networksReliabilityOR in telecommunicationsRoutingIn transmission networks an important routing problem is to find a pair of link disjoint paths which optimises some performance measure. In this paper the problem of obtaining the most reliable pair of link disjoint paths, assuming the reliability of the links are known, is considered. This is a non-linear optimisation problem. It is further introduced the constraint that the length of the paths should not exceed a certain number of links, which makes the efficient resolution of the problem more complex.http://www.sciencedirect.com/science/article/B6VCT-4JS20BJ-2/1/d3a0679a9c65e51ae2074080f957df942007info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleaplication/PDFhttp://hdl.handle.net/10316/4054http://hdl.handle.net/10316/4054https://doi.org/10.1016/j.ejor.2006.03.005engEuropean Journal of Operational Research. 181:3 (2007) 1055-1064Gomes, TeresaCraveirinha, Joséinfo: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-11-06T16:49:00Zoai:estudogeral.uc.pt:10316/4054Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:57:52.139294Repositó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 Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
title Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
spellingShingle Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
Gomes, Teresa
Reliability
OR in telecommunications
Routing
title_short Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
title_full Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
title_fullStr Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
title_full_unstemmed Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
title_sort Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
author Gomes, Teresa
author_facet Gomes, Teresa
Craveirinha, José
author_role author
author2 Craveirinha, José
author2_role author
dc.contributor.author.fl_str_mv Gomes, Teresa
Craveirinha, José
dc.subject.por.fl_str_mv Reliability
OR in telecommunications
Routing
topic Reliability
OR in telecommunications
Routing
description In transmission networks an important routing problem is to find a pair of link disjoint paths which optimises some performance measure. In this paper the problem of obtaining the most reliable pair of link disjoint paths, assuming the reliability of the links are known, is considered. This is a non-linear optimisation problem. It is further introduced the constraint that the length of the paths should not exceed a certain number of links, which makes the efficient resolution of the problem more complex.
publishDate 2007
dc.date.none.fl_str_mv 2007
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/4054
http://hdl.handle.net/10316/4054
https://doi.org/10.1016/j.ejor.2006.03.005
url http://hdl.handle.net/10316/4054
https://doi.org/10.1016/j.ejor.2006.03.005
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv European Journal of Operational Research. 181:3 (2007) 1055-1064
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv aplication/PDF
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_ 1799133868152848384

Registros relacionados