Utilize este identificador para referenciar este registo: https://hdl.handle.net/10316/87681
Título: Regeneration and grooming in MPLS over WDM networks
Autor: Nogueira, Bruna 
Mendes, Ricardo 
Martins, Lúcia 
Gomes, Teresa 
Girão-Silva, Rita 
Santos, João
Cinkler, Tibor
Palavras-chave: Shortest Path; Regeneration; Traffic Grooming; Transponder; ILP; Heuristic; WDM
Data: 1-Ago-2019
Editora: OSA and IEEE
Projeto: CENTRO-01-0145-FEDER-029312 
UID/Multi/00308/2019 
Título da revista, periódico, livro ou evento: Journal of Optical Communications and Networking
Volume: 11
Número: 8
Local de edição ou do evento: USA
Resumo: This 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.
URI: https://hdl.handle.net/10316/87681
ISSN: 1943-0639 (online)
1943-0620 (print)
DOI: 10.1364/JOCN.11.000465
Direitos: embargoedAccess
Aparece nas coleções:I&D INESCC - Artigos em Revistas Internacionais
FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato
Nogueira_et-al_JONC_2019_Aceite_Estudo_Geral.pdf422.83 kBAdobe PDFVer/Abrir
Mostrar registo em formato completo

Citações SCOPUSTM   

2
Visto em 25/mar/2024

Citações WEB OF SCIENCETM
10

1
Visto em 2/mar/2024

Visualizações de página

356
Visto em 26/mar/2024

Downloads

195
Visto em 26/mar/2024

Google ScholarTM

Verificar

Altmetric

Altmetric


Este registo está protegido por Licença Creative Commons Creative Commons