Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/95055
DC FieldValueLanguage
dc.contributor.authorRaposo, Luis-
dc.contributor.authorGomes, Teresa-
dc.contributor.authorMartins, Lúcia-
dc.contributor.authorConstantinou, Costas K.-
dc.contributor.authorEllinas, Georgios-
dc.date.accessioned2021-06-14T15:28:24Z-
dc.date.available2021-06-14T15:28:24Z-
dc.date.issued2016-
dc.identifier.citationL. Raposo, T. Gomes, L. Martins, C. K. Constantinou and G. Ellinas, "A New Arc-Disjoint-Trees scheme for survivable multicasting in mixed-graph sparse-splitting optical networks," 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016, pp. 158-165, doi: 10.1109/RNDM.2016.7608282.pt
dc.identifier.isbn978-1-4673-9023-1-
dc.identifier.urihttp://hdl.handle.net/10316/95055-
dc.description.abstractAbstract—This work addresses the problem of survivable multicast request provisioning in mixed-graph optical networks, where only a fraction of the nodes have optical splitting capabilities. An effective scheme for the calculation of a pair of disjoint trees, namely the New Arc-Disjoint Trees (NADT) protection scheme, is presented. The key idea of this 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. The proposed protection technique is combined with two existing heuristics for multicast routing in mixed-graph sparse-splitting networks. Performance results demonstrate that the proposed NADT protection technique clearly outperforms the conventional approach in terms of blocking ratio, and presents a negligible increase of the average cost of the derived pair of arc-disjoint trees.pt
dc.language.isoengpt
dc.publisherIEEEpt
dc.relationUID/MULTI/00308/2013pt
dc.rightsembargoedAccesspt
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/pt
dc.subjectResearch Subject Categories::TECHNOLOGY::Information technology::Telecommunicationpt
dc.subjectResearch Subject Categories::TECHNOLOGY::Electrical engineering, electronics and photonics::Electrical engineeringpt
dc.subjectsurvivabilitypt
dc.subjectmulticastingpt
dc.subjectoptical networkspt
dc.subjectsparse splittingpt
dc.subjectmixed graphpt
dc.titleA New Arc-Disjoint-Trees scheme for survivable multicasting in mixed-graph sparse-splitting optical networkspt
dc.typearticlept
degois.publication.firstPage158pt
degois.publication.lastPage165pt
degois.publication.locationHamstadt, Suéciapt
degois.publication.title8th International Workshop on Reliable Networks Design and Modeling (RNDM'16)pt
dc.relation.publisherversionhttps://ieeexplore.ieee.org/document/7608282pt
dc.peerreviewedyespt
dc.identifier.doi10.1109/RNDM.2016.7608282-
dc.date.embargo2016-06-29*
uc.date.periodoEmbargo180pt
item.fulltextCom Texto completo-
item.languageiso639-1en-
item.grantfulltextopen-
crisitem.author.deptFaculty of Sciences and Technology-
crisitem.author.deptFaculty of Sciences and Technology-
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.orcid0000-0002-3084-5608-
crisitem.author.orcid0000-0002-6534-0159-
Appears in Collections:I&D INESCC - Artigos e Resumos em Livros de Actas
FCTUC Eng.Electrotécnica - Artigos em Livros de Actas
Files in This Item:
File Description SizeFormat
Raposo_et-al_RNDM2016_EstudoGeral.pdfMulticasting in Mixed-Graph Sparse-Splitting Optical Networks413.21 kBAdobe PDFView/Open
Show simple item record

Page view(s)

67
checked on Dec 23, 2021

Download(s)

40
checked on Dec 23, 2021

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons