Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/95048
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cruz, Pedro | - |
dc.contributor.author | Gomes, Teresa | - |
dc.contributor.author | Medhi, Deep | - |
dc.date.accessioned | 2021-06-12T18:14:46Z | - |
dc.date.available | 2021-06-12T18:14:46Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | 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. | pt |
dc.identifier.isbn | 978-1-4799-7040-7 | - |
dc.identifier.isbn | 978-1-4799-7039-1 | - |
dc.identifier.isbn | 978-1-4799-7038-4 | - |
dc.identifier.uri | https://hdl.handle.net/10316/95048 | - |
dc.description.abstract | 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. | pt |
dc.language.iso | eng | pt |
dc.publisher | IEEE | pt |
dc.relation | QREN 23301 PANORAMA II | pt |
dc.relation | PEst-OE/EEI/UI308/2014 | pt |
dc.relation | CNS-1217736 | pt |
dc.relation | FCT PTDC/EEA-TEL/101884/2008 | pt |
dc.rights | embargoedAccess | pt |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | pt |
dc.subject | Electronics and photonics | pt |
dc.subject | Widest path | pt |
dc.subject | Disjoint routing | pt |
dc.subject | Lexicographic optimization | pt |
dc.subject | Electrical engineering | pt |
dc.title | A heuristic for widest edge-disjoint path pair lexicographic optimization | pt |
dc.type | article | pt |
degois.publication.firstPage | 9 | pt |
degois.publication.lastPage | 15 | pt |
degois.publication.location | Barcelona, Espanha | pt |
degois.publication.title | 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) | pt |
dc.relation.publisherversion | https://ieeexplore.ieee.org/document/7014925 | pt |
dc.peerreviewed | yes | pt |
dc.identifier.doi | 10.1109/RNDM.2014.7014925 | - |
dc.date.embargo | 2014-06-30 | * |
uc.date.periodoEmbargo | 180 | pt |
item.grantfulltext | open | - |
item.fulltext | Com Texto completo | - |
item.openairetype | article | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.orcid | 0000-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 | Size | Format | |
---|---|---|---|---|
Cruz_Gomes_Medhi_RNDM2014_EstudoGeral.pdf | A Heuristic for Widest Edge-disjoint Path Pair Lexicographic Optimization | 1.13 MB | Adobe PDF | View/Open |
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