Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/48329
DC FieldValueLanguage
dc.contributor.authorGomes, Teresa-
dc.contributor.authorSoares, Miguel-
dc.contributor.authorCraveirinha, José-
dc.contributor.authorMelo, Paulo-
dc.contributor.authorJorge, Luísa-
dc.contributor.authorMirones, Vitor-
dc.contributor.authorBrízido, André-
dc.date.accessioned2018-04-16T11:54:44Z-
dc.date.available2018-04-16T11:54:44Z-
dc.date.issued2015-
dc.identifier.issn1064-7570por
dc.identifier.urihttp://hdl.handle.net/10316/48329-
dc.descriptionTwo Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Costpor
dc.description.abstractA Shared Risk Link Group (SRLG) is a set of links which share a common risk of failure. Routing protocols in Generalized MultiProtocol Label Switching (GMPLS), using distributed SRLG information, can calculate paths avoiding certain SRLGs. For single SRLG failure an end-to-end SRLG-disjoint path pair can be calculated, but to ensure connection in the event of multiple SRLG failures a set with more than two end-to-end SRLG-disjoint paths should be used. Two heuristic, the Conflicting SRLG-Exclusion Min Sum (CoSE-MS) and the Iterative Modified Suurballes's Heuristic (IMSH), for calculating node and SRLG-disjoint path pairs, which use the Modified Suurballes's Heuristic (MSH), are reviewed and new versions (CoSE-MScd and IMSHd) are proposed, which may improve the number of obtained optimal solutions. Moreover two new heuristics are proposed: kCoSE-MScd and kIMSHd, to calculate a set of k node and SRLG-disjoint paths, seeking to minimize its total cost. To the best of our knowledge these heuristics are a first proposal for seeking a set of k (k>2) node and SRLG-disjoint paths of minimal additive cost. The performance of the proposed heuristics is evaluated using a real network structure, where SRLGs were randomly defined. The number of solutions found, the percentage of optimal solutions and the relative error of the sub-optimal solutions are presented. Also the CPU time for solving the problem in a Path Computation Element (PCE) is reported.por
dc.description.sponsorshipThe author acknowledges 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 PEst-OE/EEI/UI308/2014 and by Project PERGS of Portugal Telecom Inovação.por
dc.language.isoengpor
dc.publisherSpringerpor
dc.relationQREN 23301 PANORAMA IIpor
dc.relationPEst-OE/EEI/UI308/2014por
dc.relationPERGS (Portugal Telecom Inovação)por
dc.rightsopenAccesspor
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/por
dc.subjectdiverse routingpor
dc.subjectSRLG-disjointpor
dc.subjectnode-disjointpor
dc.subjectmin-sumpor
dc.titleTwo Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Costpor
dc.typearticlepor
degois.publication.firstPage1067por
degois.publication.lastPage1103por
degois.publication.issue4por
degois.publication.titleJournal of Network and Systems Managementpor
dc.relation.publisherversionhttps://link.springer.com/article/10.1007%2Fs10922-014-9332-6por
dc.peerreviewedyespor
dc.identifier.doi10.1007/s10922-014-9332-6por
degois.publication.volume23por
item.grantfulltextopen-
item.languageiso639-1en-
item.fulltextCom Texto completo-
crisitem.author.deptFaculty of Sciences and Technology-
crisitem.author.deptFaculty of Sciences and Technology-
crisitem.author.deptFaculty of Economics-
crisitem.author.parentdeptUniversity of Coimbra-
crisitem.author.parentdeptUniversity of Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.researchunitCeBER – Centre for Business and Economics Research-
crisitem.author.orcid0000-0002-3084-5608-
crisitem.author.orcid0000-0001-8562-3730-
crisitem.author.orcid0000-0002-9166-0615-
Appears in Collections:FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais
I&D INESCC - Artigos em Revistas Internacionais
Files in This Item:
File Description SizeFormat
gomes_et_al_R2_JONS_2015_EstudoGeral.pdf1.14 MBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

1
checked on Feb 18, 2020

Page view(s) 50

396
checked on Dec 23, 2021

Download(s) 50

346
checked on Dec 23, 2021

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons