Repository logo
 
Publication

Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks

dc.contributor.authorGomes, Teresa
dc.contributor.authorJorge, Luísa
dc.contributor.authorMelo, Paulo
dc.contributor.authorGirão-Silva, Rita
dc.contributor.authorMendes, Sérgio
dc.date.accessioned2014-10-02T11:33:28Z
dc.date.available2014-10-02T11:33:28Z
dc.date.issued2013
dc.description.abstractIn end-to-end connections it is sometimes not possible to find a totally disjoint path pair. In this context it may be reasonable to accept a path pair which is as disjoint as possible, and thus provide the best (in a certain sense) level of the single fault protection that can be ensured. A Shared Risk Link Group (SRLG) is a group of links which have a common risk of failure (which may result from the sharing of common resources at a lower layer). The concept of SRLG allows an upper layer to be capable of implementing diverse routing, taking into account the existence of common risks of failure. Two heuristics for solving the min-sum maximally node and SRLG-disjoint path pair, formulated as a multi-objective optimization problem, are presented. The relative performance of the heuristics is evaluated using three different networks. The envisaged application scenario of these path calculation algorithms is Generalized Multiprotocol Label Switching (GMPLS) networks.por
dc.description.sponsorshipThis work has been partially supported by PT Inovação R&D Project “End to end considering SRLGs – II”, by programme COMPETE of the EC Community Support Framework III and cosponsored by the EC fund FEDER, Project FCT PTDC/EEA TEL/101884/2008, by FCT under project grant PEst-C/EEI/UI0308/2011 and by Project CENTRO-07-0224-FEDER-002003.
dc.identifier.citationGomes, Teresa; Jorge, Luísa; Melo, Paulo; Girão-Silva, Rita; Mendes, Sérgio (2013). Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks. In 2013 9th International Conference on the Design of Reliable Communication Networks, DRCN 2013 . Budapest. p. 314-321. ISBN 9781479900497por
dc.identifier.isbn9781479900497
dc.identifier.urihttp://hdl.handle.net/10198/10683
dc.language.isoengpor
dc.peerreviewedyespor
dc.relation“End to end Protection considering SRLGs – II” - PT Inovação R&D, Programme COMPETE of the EC Community Support Framework III, EC fund FEDER, FCT PTDC/EEA-TEL/101884/2008, FCT PEst-C/EEI/UI0308/2011 e CENTRO-07-0224-FEDER-002003.por
dc.relationMulticriteria Routing in MPLS and WDM Networks
dc.relationFUSÕES E AQUISIÇÕES: EFEITOS SECTORIAIS E NO MERCADO DE TRABALHO
dc.subjectMultiprotocol label switchingpor
dc.subjectOptimisationpor
dc.subjectRadio linkspor
dc.subjectTelecommunication network reliabilitypor
dc.subjectTelecommunication network routingpor
dc.titleCalculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networkspor
dc.typeconference paper
dspace.entity.typePublication
oaire.awardTitleMulticriteria Routing in MPLS and WDM Networks
oaire.awardTitleFUSÕES E AQUISIÇÕES: EFEITOS SECTORIAIS E NO MERCADO DE TRABALHO
oaire.awardURIinfo:eu-repo/grantAgreement/FCT/5876-PPCDTI/PTDC%2FEEA-TEL%2F101884%2F2008/PT
oaire.awardURIinfo:eu-repo/grantAgreement/FCT//SFRH%2FBD%2F80308%2F2011/PT
oaire.citation.conferencePlaceBudapestpor
oaire.citation.endPage321por
oaire.citation.startPage314por
oaire.citation.title2013 9th International Conference on the Design of Reliable Communication Networks, DRCN 2013por
oaire.fundingStream5876-PPCDTI
person.familyNameJorge
person.givenNameLuísa
person.identifier.ciencia-idAB16-0263-87CB
person.identifier.orcid0000-0002-0623-7282
person.identifier.ridF-5156-2014
person.identifier.scopus-author-id22134881600
project.funder.identifierhttp://doi.org/10.13039/501100001871
project.funder.identifierhttp://doi.org/10.13039/501100001871
project.funder.nameFundação para a Ciência e a Tecnologia
project.funder.nameFundação para a Ciência e a Tecnologia
rcaap.rightsrestrictedAccesspor
rcaap.typeconferenceObjectpor
relation.isAuthorOfPublication103e1f8c-bbdc-4ea3-a014-7b3b69ae5a00
relation.isAuthorOfPublication.latestForDiscovery103e1f8c-bbdc-4ea3-a014-7b3b69ae5a00
relation.isProjectOfPublication4958d46b-e44f-45c3-85a3-328ac6e0458e
relation.isProjectOfPublication591c20de-15a4-4625-91b6-bdaf80d27b9f
relation.isProjectOfPublication.latestForDiscovery591c20de-15a4-4625-91b6-bdaf80d27b9f

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
dcrn2013.pdf
Size:
145.91 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.75 KB
Format:
Item-specific license agreed upon to submission
Description: