Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/47950
DC FieldValueLanguage
dc.contributor.authorGomes, Teresa-
dc.contributor.authorRaposo, Luís-
dc.contributor.authorEllinas, Georgios-
dc.date.accessioned2018-03-10T16:37:26Z-
dc.date.available2018-03-10T16:37:26Z-
dc.date.issued2017-
dc.identifier.citationT. Gomes, L. Raposo, G. Ellinas. ''Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks'', Networks, Volume 70, Issue 4, 2017, Pages 360-372. DOI: 10.1002/net.21781por
dc.identifier.urihttp://hdl.handle.net/10316/47950-
dc.description.abstractThis work addresses the problem of dedicated protection of multicast sessions in mixed-graph optical networks, where only a fraction of the nodes have optical splitting capabilities. A novel multicast routing algorithm for sparse splitting optical networks (the Modified Steiner Tree Heuristic (MSTH)) is initially presented and is subsequently utilized (together with two existing heuristics (MUS and MSH)) by an effective scheme for the calculation of a pair of disjoint trees. The key idea of this New Arc-Disjoint Trees (NADT) protection technique is to gradually construct the primary tree, verifying that after the addition of each one of the destinations of the multicast session, a secondary (arc-disjoint) tree can still be obtained. Performance results demonstrate that the proposed NADT protection technique clearly outperforms the conventional Arc-Disjoint Trees (ADT) approach in terms of blocking ratio, while incurring only a negligible increase of the average cost of the derived pair of arc-disjoint trees. Furthermore, it is shown that the newly proposed algorithm, MSTH-NADT, is the one having the best performance in terms of cost and blocking, with MSH-NADT having similar, albeit slightly worse, performance. However, as MSH-NADT requires much less CPU time compared to MSTH-NADT, MSH-NADT can be considered the best compromise technique.por
dc.language.isoengpor
dc.publisherWileypor
dc.relationinfo:eu-repo/grantAgreement/FCT/5876/147388/PTpor
dc.rightsembargoedAccess-
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/por
dc.subjectsurvivabilitypor
dc.subjectmulticastingpor
dc.subjectoptical networkspor
dc.subjectsparse splittingpor
dc.subjectheuristicspor
dc.titleDedicated protection of multicast sessions in mixed-graph sparse-splitting optical networkspor
dc.typearticlepor
degois.publication.firstPage360por
degois.publication.lastPage372por
degois.publication.issue4por
degois.publication.titleNetworkspor
dc.relation.publisherversionhttp://onlinelibrary.wiley.com/doi/10.1002/net.21781/fullpor
dc.peerreviewedyespor
dc.identifier.doi10.1002/net.21781-
degois.publication.volume70por
dc.date.embargo2019-01-01-
item.languageiso639-1en-
item.fulltextCom Texto completo-
item.grantfulltextopen-
crisitem.author.deptFaculty of Sciences and Technology-
crisitem.author.parentdeptUniversity of Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.orcid0000-0002-3084-5608-
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_Raposo_Ellinas_Networks_2017_EstudoGeral.pdf794.72 kBAdobe PDFView/Open
Show simple item record

WEB OF SCIENCETM
Citations 20

1
checked on Nov 2, 2021

Page view(s) 20

542
checked on Nov 24, 2021

Download(s)

150
checked on Nov 24, 2021

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons