Regeneration and grooming in MPLS over WDM networks

Bruna Nogueira, Ricardo Mendes, Lucia Martins, Teresa Gomes, Rita Girao-Silva, Joao Santos, T. Cinkler

Research output: Contribution to journalArticle

Abstract

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 to strategically place 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.

Original languageEnglish
Article number8782277
Pages (from-to)465-477
Number of pages13
JournalJournal of Optical Communications and Networking
Volume11
Issue number8
DOIs
Publication statusPublished - Aug 1 2019

Fingerprint

Wavelength division multiplexing
Linear programming
Transponders
Wavelength
Network layers
Multilayers
Topology
Fibers

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Nogueira, B., Mendes, R., Martins, L., Gomes, T., Girao-Silva, R., Santos, J., & Cinkler, T. (2019). Regeneration and grooming in MPLS over WDM networks. Journal of Optical Communications and Networking, 11(8), 465-477. [8782277]. https://doi.org/10.1364/JOCN.11.000465

Regeneration and grooming in MPLS over WDM networks. / Nogueira, Bruna; Mendes, Ricardo; Martins, Lucia; Gomes, Teresa; Girao-Silva, Rita; Santos, Joao; Cinkler, T.

In: Journal of Optical Communications and Networking, Vol. 11, No. 8, 8782277, 01.08.2019, p. 465-477.

Research output: Contribution to journalArticle

Nogueira, B, Mendes, R, Martins, L, Gomes, T, Girao-Silva, R, Santos, J & Cinkler, T 2019, 'Regeneration and grooming in MPLS over WDM networks', Journal of Optical Communications and Networking, vol. 11, no. 8, 8782277, pp. 465-477. https://doi.org/10.1364/JOCN.11.000465
Nogueira B, Mendes R, Martins L, Gomes T, Girao-Silva R, Santos J et al. Regeneration and grooming in MPLS over WDM networks. Journal of Optical Communications and Networking. 2019 Aug 1;11(8):465-477. 8782277. https://doi.org/10.1364/JOCN.11.000465
Nogueira, Bruna ; Mendes, Ricardo ; Martins, Lucia ; Gomes, Teresa ; Girao-Silva, Rita ; Santos, Joao ; Cinkler, T. / Regeneration and grooming in MPLS over WDM networks. In: Journal of Optical Communications and Networking. 2019 ; Vol. 11, No. 8. pp. 465-477.
@article{1b3b66b63fb549acb36b216689b66a17,
title = "Regeneration and grooming in MPLS over WDM networks",
abstract = "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 to strategically place 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.",
author = "Bruna Nogueira and Ricardo Mendes and Lucia Martins and Teresa Gomes and Rita Girao-Silva and Joao Santos and T. Cinkler",
year = "2019",
month = "8",
day = "1",
doi = "10.1364/JOCN.11.000465",
language = "English",
volume = "11",
pages = "465--477",
journal = "Journal of Optical Communications and Networking",
issn = "1943-0620",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - Regeneration and grooming in MPLS over WDM networks

AU - Nogueira, Bruna

AU - Mendes, Ricardo

AU - Martins, Lucia

AU - Gomes, Teresa

AU - Girao-Silva, Rita

AU - Santos, Joao

AU - Cinkler, T.

PY - 2019/8/1

Y1 - 2019/8/1

N2 - 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 to strategically place 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.

AB - 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 to strategically place 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.

UR - http://www.scopus.com/inward/record.url?scp=85070271149&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85070271149&partnerID=8YFLogxK

U2 - 10.1364/JOCN.11.000465

DO - 10.1364/JOCN.11.000465

M3 - Article

AN - SCOPUS:85070271149

VL - 11

SP - 465

EP - 477

JO - Journal of Optical Communications and Networking

JF - Journal of Optical Communications and Networking

SN - 1943-0620

IS - 8

M1 - 8782277

ER -