Publicação
Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost
| Resumo: | 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. |
|---|---|
| Autores principais: | Gomes, Teresa |
| Outros Autores: | Soares, Miguel; Craveirinha, José; Melo, Paulo; Jorge, Luísa; Mirones, Vítor; Brizído, André |
| Assunto: | Diverse routing SRLG-disjoint Node-disjoint Min-sum |
| Ano: | 2015 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Instituto Politécnico de Bragança |
| Idioma: | inglês |
| Origem: | Biblioteca Digital do IPB |
| _version_ | 1867173344558710784 |
|---|---|
| author | Gomes, Teresa |
| author2 | Soares, Miguel Craveirinha, José Melo, Paulo Jorge, Luísa Mirones, Vítor Brizído, André |
| author2_role | author author author author author author |
| author_facet | Gomes, Teresa Soares, Miguel Craveirinha, José Melo, Paulo Jorge, Luísa Mirones, Vítor Brizído, André |
| author_role | author |
| contributor_name_str_mv | Biblioteca Digital do IPB |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Gomes, Teresa\"},{\"Person.name\":\"Soares, Miguel\"},{\"Person.name\":\"Craveirinha, José\"},{\"Person.name\":\"Melo, Paulo\"},{\"Person.name\":\"Jorge, Luísa\",\"Person.identifier.orcid\":\"0000-0002-0623-7282\"},{\"Person.name\":\"Mirones, Vítor\"},{\"Person.name\":\"Brizído, André\"}] |
| datacite.contributors.contributor.contributorName.fl_str_mv | Biblioteca Digital do IPB |
| datacite.creators.creator.creatorName.fl_str_mv | Gomes, Teresa Soares, Miguel Craveirinha, José Melo, Paulo Jorge, Luísa Mirones, Vítor Brizído, André |
| datacite.date.Accepted.fl_str_mv | 2015-01-01T00:00:00Z |
| datacite.date.available.fl_str_mv | 2015-02-12T11:02:44Z |
| datacite.date.embargoed.fl_str_mv | 2015-02-12T11:02:44Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| datacite.subjects.subject.fl_str_mv | Diverse routing SRLG-disjoint Node-disjoint Min-sum |
| datacite.titles.title.fl_str_mv | Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost |
| dc.contributor.none.fl_str_mv | Biblioteca Digital do IPB |
| dc.creator.none.fl_str_mv | Gomes, Teresa Soares, Miguel Craveirinha, José Melo, Paulo Jorge, Luísa Mirones, Vítor Brizído, André |
| dc.date.Accepted.fl_str_mv | 2015-01-01T00:00:00Z |
| dc.date.available.fl_str_mv | 2015-02-12T11:02:44Z |
| dc.date.embargoed.fl_str_mv | 2015-02-12T11:02:44Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10198/11657 |
| dc.language.none.fl_str_mv | eng |
| dc.publisher.none.fl_str_mv | Springer |
| dc.rights.none.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| dc.subject.none.fl_str_mv | Diverse routing SRLG-disjoint Node-disjoint Min-sum |
| dc.title.fl_str_mv | Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_6501 |
| description | 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. |
| dirty | 0 |
| eu_rights_str_mv | openAccess |
| format | article |
| fulltext.url.fl_str_mv | https://bibliotecadigital.ipb.pt/bitstreams/1b9c8320-1297-4567-a62f-37c1ed64b8e7/download |
| id | ipb_a02a1a4f8e2e818ce6d8e8ea8749fefb |
| identifier.url.fl_str_mv | http://hdl.handle.net/10198/11657 |
| instacron_str | ipb |
| institution | Instituto Politécnico de Bragança |
| instname_str | Instituto Politécnico de Bragança |
| language | eng |
| network_acronym_str | ipb |
| network_name_str | Biblioteca Digital do IPB |
| oai_identifier_str | oai:bibliotecadigital.ipb.pt:10198/11657 |
| organization_str_mv | urn:organizationAcronym:ipb |
| person_str_mv | Gomes, Teresa Soares, Miguel Craveirinha, José Melo, Paulo Jorge, Luísa Jorge, Luísa https://www.ciencia-id.pt/AB16-0263-87CB AB16-0263-87CB http://orcid.org/0000-0002-0623-7282 0000-0002-0623-7282 Mirones, Vítor Brizído, André |
| publishDate | 2015 |
| publisher.none.fl_str_mv | Springer |
| reponame_str | Biblioteca Digital do IPB |
| repository_id_str | urn:repositoryAcronym:ipb |
| service_str_mv | urn:repositoryAcronym:ipb |
| spelling | engSpringerporA 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.application/pdfporTwo heuristics for calculating a shared risk link group disjoint set of paths of min-sum costGomes, TeresaSoares, MiguelCraveirinha, JoséMelo, PauloPersonalJorge, LuísaDSpacehttp://dspace.org/items/103e1f8c-bbdc-4ea3-a014-7b3b69ae5a00DSpacehttp://dspace.org/items/103e1f8c-bbdc-4ea3-a014-7b3b69ae5a00JorgeLuísaCiência IDhttps://www.ciencia-id.ptAB16-0263-87CBORCIDhttp://orcid.org0000-0002-0623-7282Researcher IDhttps://www.researcherid.comF-5156-2014Researcher IDhttps://www.researcherid.comAAM-4634-2020Scopus Author IDhttps://www.scopus.com22134881600Mirones, VítorBrizído, AndréHostingInstitutionOrganizationalBiblioteca Digital do IPBe-mailmailto:dspace@ipb.ptdspace@ipb.ptISSNIsPartOf1064-7570ISSNIsPartOf1064-7570DOIIsPartOf10.1007/s10922-014-9332-62015-02-12T11:02:44Z20152015-01-01T00:00:00ZHandlehttp://hdl.handle.net/10198/11657http://purl.org/coar/access_right/c_abf2open accessDiverse routingSRLG-disjointNode-disjointMin-sum2365682 bytesliteraturehttp://purl.org/coar/resource_type/c_6501journal articlehttp://purl.org/coar/access_right/c_abf2application/pdffulltexthttps://bibliotecadigital.ipb.pt/bitstreams/1b9c8320-1297-4567-a62f-37c1ed64b8e7/downloadJournal of Network and Systems Management |
| spellingShingle | Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost Gomes, Teresa Diverse routing SRLG-disjoint Node-disjoint Min-sum |
| status | SINGLETON |
| subject.fl_str_mv | Diverse routing SRLG-disjoint Node-disjoint Min-sum |
| title | Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost |
| title_full | Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost |
| title_fullStr | Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost |
| title_full_unstemmed | Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost |
| title_short | Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost |
| title_sort | Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost |
| topic | Diverse routing SRLG-disjoint Node-disjoint Min-sum |
| topic_facet | Diverse routing SRLG-disjoint Node-disjoint Min-sum |
| url | http://hdl.handle.net/10198/11657 |
| visible | 1 |