Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/87681
DC FieldValueLanguage
dc.contributor.authorNogueira, Bruna-
dc.contributor.authorMendes, Ricardo-
dc.contributor.authorMartins, Lúcia-
dc.contributor.authorGomes, Teresa-
dc.contributor.authorGirão-Silva, Rita-
dc.contributor.authorSantos, João-
dc.contributor.authorCinkler, Tibor-
dc.date.accessioned2019-10-03T19:04:49Z-
dc.date.available2019-10-03T19:04:49Z-
dc.date.issued2019-08-01-
dc.identifier.issn1943-0639 (online)pt
dc.identifier.issn1943-0620 (print)pt
dc.identifier.urihttp://hdl.handle.net/10316/87681-
dc.description.abstractThis work addresses the Grooming, Routing and Wavelength Assignment with Regeneration (GRWAR) problem for meshed networks, in static traffic scenarios. It focuses primarily on the Grooming and Routing with Regeneration (GRR) problem. Physical impairments were considered in the model, imposing a limit in lightpath lengths without regeneration. This creates the opportunity of strategically placing transponders for both grooming and regeneration. The GRR problem is tackled lexicographically, which means that for a given network topology and a traffic matrix, the goal is to route and groom connection requests in a way that minimizes the number of transponders and, for that number of transponders, throughout minimum length routes. To solve this problem, an Integer Linear Programming (ILP) formulation was developed considering undirected networks and explicitly including the relationship between the different network layers. The results of the ILP model are used to validate a heuristic suited to be included in a Software Defined Network (SDN) platform in a multilayer core network. The GRWAR problem is addressed after a solution for the GRR problem is obtained, using a first-fit approach to assign wavelengths to the lightpaths obtained by the ILP and the heuristic. The wavelength assignment problem is less critical, due to the large number of wavelengths per fiber. The ILP and the heuristic were compared for small networks, with the heuristic providing good results in very short time, proving to be efficient and better suited for larger problems, as is confirmed through a set of proposed bounds.pt
dc.description.sponsorshipBruna Nogueira and Ricardo Mendes acknowledge Infinera Portugal for a MSc scholarship during which this work was developed.pt
dc.language.isoengpt
dc.publisherOSA and IEEEpt
dc.relationCENTRO-01-0145-FEDER-029312pt
dc.relationUID/Multi/00308/2019pt
dc.rightsembargoedAccesspt
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/pt
dc.subjectShortest Pathpt
dc.subjectRegenerationpt
dc.subjectTraffic Groomingpt
dc.subjectTransponderpt
dc.subjectILPpt
dc.subjectHeuristicpt
dc.subjectWDMpt
dc.titleRegeneration and grooming in MPLS over WDM networkspt
dc.typearticle-
degois.publication.firstPage465pt
degois.publication.lastPage477pt
degois.publication.issue8pt
degois.publication.locationUSApt
degois.publication.titleJournal of Optical Communications and Networkingpt
dc.relation.publisherversionhttps://www.osapublishing.org/jocn/abstract.cfm?uri=jocn-11-8-465pt
dc.peerreviewedyespt
dc.identifier.doi10.1364/JOCN.11.000465pt
degois.publication.volume11pt
dc.date.embargo2020-07-31*
rcaap.embargofctEmbargo requerido pela editora.pt
uc.date.periodoEmbargo365pt
item.fulltextCom Texto completo-
item.grantfulltextopen-
item.languageiso639-1en-
crisitem.author.deptFaculty of Sciences and Technology-
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.parentdeptUniversity of Coimbra-
crisitem.author.researchunitCISUC - Centre for Informatics and Systems of the University 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.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.parentresearchunitFaculty of Sciences and Technology-
crisitem.author.orcid0000-0003-2077-7223-
crisitem.author.orcid0000-0002-6534-0159-
crisitem.author.orcid0000-0002-3084-5608-
crisitem.author.orcid0000-0002-2331-8340-
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
Nogueira_et-al_JONC_2019_Aceite_Estudo_Geral.pdf422.83 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

1
checked on May 29, 2020

WEB OF SCIENCETM
Citations 10

1
checked on Aug 2, 2022

Page view(s)

294
checked on Sep 27, 2022

Download(s)

153
checked on Sep 27, 2022

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons