A heuristic for widest edge-disjoint path pair lexicographic optimization

Detalhes bibliográficos
Autor(a) principal: Cruz, Pedro
Data de Publicação: 2014
Outros Autores: Gomes, Teresa, Medhi, Deep
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/95048
https://doi.org/10.1109/RNDM.2014.7014925
Resumo: Telecommunication services are pervasive in today’s human activity and are required to offer reliable and quality-of- service(QoS)-aware guaranteed services. In global path protection, the working path between a source and a destination can be protected by a backup path, which ensures data transfer in the event of a failure that makes the working path to be unavailable. Multipath and disjoint routing may require the calculation of disjoint paths maximizing the total bandwidth of the path pair (or set of paths) or the calculation of maximum-bandwidth disjoint paths. In this paper, a lexicographic optimization problem for obtaining maximum-bandwidth disjoint paths, and then maximizing the bandwidth of the widest path in the pair, is formalized. An effective heuristic for addressing this problem is presented.
id RCAP_5ba85501fe6b54c03d20d86ec040cf80
oai_identifier_str oai:estudogeral.uc.pt:10316/95048
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 A heuristic for widest edge-disjoint path pair lexicographic optimizationElectronics and photonicsWidest pathDisjoint routingLexicographic optimizationElectrical engineeringTelecommunication services are pervasive in today’s human activity and are required to offer reliable and quality-of- service(QoS)-aware guaranteed services. In global path protection, the working path between a source and a destination can be protected by a backup path, which ensures data transfer in the event of a failure that makes the working path to be unavailable. Multipath and disjoint routing may require the calculation of disjoint paths maximizing the total bandwidth of the path pair (or set of paths) or the calculation of maximum-bandwidth disjoint paths. In this paper, a lexicographic optimization problem for obtaining maximum-bandwidth disjoint paths, and then maximizing the bandwidth of the widest path in the pair, is formalized. An effective heuristic for addressing this problem is presented.IEEE2014info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/95048http://hdl.handle.net/10316/95048https://doi.org/10.1109/RNDM.2014.7014925engP. Cruz, T. Gomes and D. Medhi, "A heuristic for widest edge-disjoint path pair lexicographic optimization," 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM), 2014, pp. 9-15, doi: 10.1109/RNDM.2014.7014925.978-1-4799-7040-7978-1-4799-7039-1978-1-4799-7038-4https://ieeexplore.ieee.org/document/7014925Cruz, PedroGomes, TeresaMedhi, Deepinfo: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:RCAAP2021-07-16T14:53:48Zoai:estudogeral.uc.pt:10316/95048Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:13:38.526383Repositó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 A heuristic for widest edge-disjoint path pair lexicographic optimization
title A heuristic for widest edge-disjoint path pair lexicographic optimization
spellingShingle A heuristic for widest edge-disjoint path pair lexicographic optimization
Cruz, Pedro
Electronics and photonics
Widest path
Disjoint routing
Lexicographic optimization
Electrical engineering
title_short A heuristic for widest edge-disjoint path pair lexicographic optimization
title_full A heuristic for widest edge-disjoint path pair lexicographic optimization
title_fullStr A heuristic for widest edge-disjoint path pair lexicographic optimization
title_full_unstemmed A heuristic for widest edge-disjoint path pair lexicographic optimization
title_sort A heuristic for widest edge-disjoint path pair lexicographic optimization
author Cruz, Pedro
author_facet Cruz, Pedro
Gomes, Teresa
Medhi, Deep
author_role author
author2 Gomes, Teresa
Medhi, Deep
author2_role author
author
dc.contributor.author.fl_str_mv Cruz, Pedro
Gomes, Teresa
Medhi, Deep
dc.subject.por.fl_str_mv Electronics and photonics
Widest path
Disjoint routing
Lexicographic optimization
Electrical engineering
topic Electronics and photonics
Widest path
Disjoint routing
Lexicographic optimization
Electrical engineering
description Telecommunication services are pervasive in today’s human activity and are required to offer reliable and quality-of- service(QoS)-aware guaranteed services. In global path protection, the working path between a source and a destination can be protected by a backup path, which ensures data transfer in the event of a failure that makes the working path to be unavailable. Multipath and disjoint routing may require the calculation of disjoint paths maximizing the total bandwidth of the path pair (or set of paths) or the calculation of maximum-bandwidth disjoint paths. In this paper, a lexicographic optimization problem for obtaining maximum-bandwidth disjoint paths, and then maximizing the bandwidth of the widest path in the pair, is formalized. An effective heuristic for addressing this problem is presented.
publishDate 2014
dc.date.none.fl_str_mv 2014
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/95048
http://hdl.handle.net/10316/95048
https://doi.org/10.1109/RNDM.2014.7014925
url http://hdl.handle.net/10316/95048
https://doi.org/10.1109/RNDM.2014.7014925
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv P. Cruz, T. Gomes and D. Medhi, "A heuristic for widest edge-disjoint path pair lexicographic optimization," 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM), 2014, pp. 9-15, doi: 10.1109/RNDM.2014.7014925.
978-1-4799-7040-7
978-1-4799-7039-1
978-1-4799-7038-4
https://ieeexplore.ieee.org/document/7014925
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv IEEE
publisher.none.fl_str_mv IEEE
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_ 1799134032291692544

Registros relacionados