Publication
Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost
| dc.contributor.author | Gomes, Teresa | |
| dc.contributor.author | Soares, Miguel | |
| dc.contributor.author | Craveirinha, José | |
| dc.contributor.author | Melo, Paulo | |
| dc.contributor.author | Jorge, Luísa | |
| dc.contributor.author | Mirones, Vítor | |
| dc.contributor.author | Brizído, André | |
| dc.date.accessioned | 2015-02-12T11:02:44Z | |
| dc.date.available | 2015-02-12T11:02:44Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | A shared risk link group (SRLG) is a set of links which share a common risk of failure. Routing protocols in Generalized MultiProtocol Label Switching, 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, 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 is reported. | por |
| dc.identifier.citation | Gomes, Teresa; Soares, Miguel; Craveirinha, Jose; Melo, Paulo; Jorge, Luísa; Mirones, Vitor; Brízido, André (2014). Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost. Journal of Network and Systems Management. ISSN 1064-7570. 23:4, p. 1067-1103 | por |
| dc.identifier.doi | 10.1007/s10922-014-9332-6 | |
| dc.identifier.eissn | 1573-7705 | |
| dc.identifier.issn | 1064-7570 | |
| dc.identifier.issn | 1064-7570 | |
| dc.identifier.uri | http://hdl.handle.net/10198/11657 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | Springer | por |
| dc.relation | 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), Project PEst-OE/EEI/UI308/2014 and Project PERGS of Portugal Telecom Inovação. | por |
| dc.subject | Diverse routing | por |
| dc.subject | SRLG-disjoint | por |
| dc.subject | Node-disjoint | por |
| dc.subject | Min-sum | por |
| dc.title | Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost | por |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.title | Journal of Network and Systems Management | por |
| person.familyName | Jorge | |
| person.givenName | Luísa | |
| person.identifier.ciencia-id | AB16-0263-87CB | |
| person.identifier.orcid | 0000-0002-0623-7282 | |
| person.identifier.rid | F-5156-2014 | |
| person.identifier.scopus-author-id | 22134881600 | |
| rcaap.rights | restrictedAccess | por |
| rcaap.type | article | por |
| relation.isAuthorOfPublication | 103e1f8c-bbdc-4ea3-a014-7b3b69ae5a00 | |
| relation.isAuthorOfPublication.latestForDiscovery | 103e1f8c-bbdc-4ea3-a014-7b3b69ae5a00 |