Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/95048
DC FieldValueLanguage
dc.contributor.authorCruz, Pedro-
dc.contributor.authorGomes, Teresa-
dc.contributor.authorMedhi, Deep-
dc.date.accessioned2021-06-12T18:14:46Z-
dc.date.available2021-06-12T18:14:46Z-
dc.date.issued2014-
dc.identifier.citationP. 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.pt
dc.identifier.isbn978-1-4799-7040-7-
dc.identifier.isbn978-1-4799-7039-1-
dc.identifier.isbn978-1-4799-7038-4-
dc.identifier.urihttps://hdl.handle.net/10316/95048-
dc.description.abstractTelecommunication 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.pt
dc.language.isoengpt
dc.publisherIEEEpt
dc.relationQREN 23301 PANORAMA IIpt
dc.relationPEst-OE/EEI/UI308/2014pt
dc.relationCNS-1217736pt
dc.relationFCT PTDC/EEA-TEL/101884/2008pt
dc.rightsembargoedAccesspt
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/pt
dc.subjectElectronics and photonicspt
dc.subjectWidest pathpt
dc.subjectDisjoint routingpt
dc.subjectLexicographic optimizationpt
dc.subjectElectrical engineeringpt
dc.titleA heuristic for widest edge-disjoint path pair lexicographic optimizationpt
dc.typearticlept
degois.publication.firstPage9pt
degois.publication.lastPage15pt
degois.publication.locationBarcelona, Espanhapt
degois.publication.title2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)pt
dc.relation.publisherversionhttps://ieeexplore.ieee.org/document/7014925pt
dc.peerreviewedyespt
dc.identifier.doi10.1109/RNDM.2014.7014925-
dc.date.embargo2014-06-30*
uc.date.periodoEmbargo180pt
item.grantfulltextopen-
item.fulltextCom Texto completo-
item.openairetypearticle-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.orcid0000-0002-3084-5608-
Appears in Collections:FCTUC Eng.Electrotécnica - Artigos em Livros de Actas
I&D INESCC - Artigos e Resumos em Livros de Actas
Files in This Item:
File Description SizeFormat
Cruz_Gomes_Medhi_RNDM2014_EstudoGeral.pdfA Heuristic for Widest Edge-disjoint Path Pair Lexicographic Optimization1.13 MBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

10
checked on Nov 11, 2022

Page view(s)

159
checked on Apr 30, 2024

Download(s)

193
checked on Apr 30, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons