Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical Network

This paper proposes three novel integer linear programming (ILP) formulations, where the first model deals with the Grooming, Routing, Wavelength Assignment, and Carrier Ethernet Interface Allocation Problem (GRWA-I); the second to Traffic Re-Grooming Problem (TRGP) to accommodate demand changes in...

Full description

Bibliographic Details
Main Author: Leandro Colombi Resendo
Format: Article
Language:English
Published: Sociedade Brasileira de Microondas e Optoeletrônica; Sociedade Brasileira de Eletromagnetismo
Series:Journal of Microwaves, Optoelectronics and Electromagnetic Applications
Subjects:
Online Access:http://www.scielo.br/scielo.php?script=sci_arttext&pid=S2179-10742013000200030&lng=en&tlng=en
id doaj-bc6f41eed24746feb00112a6533573f8
record_format Article
spelling doaj-bc6f41eed24746feb00112a6533573f82020-11-25T01:13:23ZengSociedade Brasileira de Microondas e Optoeletrônica; Sociedade Brasileira de EletromagnetismoJournal of Microwaves, Optoelectronics and Electromagnetic Applications2179-107412262863710.1590/S2179-10742013000200030S2179-10742013000200030Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical NetworkLeandro Colombi Resendo0Instituto Federal de Educação, Ciência e Tecnologia do Espirito SantoThis paper proposes three novel integer linear programming (ILP) formulations, where the first model deals with the Grooming, Routing, Wavelength Assignment, and Carrier Ethernet Interface Allocation Problem (GRWA-I); the second to Traffic Re-Grooming Problem (TRGP) to accommodate demand changes in a GRWA-I network scenarios; and the third to Traffic Re-Grooming demands in case of failures. The traffic re-grooming problem consists basically in assigning demands change in a working network, without affect others requests. In addition, in this work, it problem is formulated for the first time using ILP model. As TRGP needs a configured network scenario as input parameter, the first model proposed accomplish this task for the first network scenario. In numerical results, it was used a 14-node network (NSFnet) and 6 traffic matrix. Moreover, the models proposed were compared with a shortest path (SP) routing method. Results show the difference for network cost between an optimal method and a heuristic design over time, as well as the importance of an initial optimal configuration for future network growth.http://www.scielo.br/scielo.php?script=sci_arttext&pid=S2179-10742013000200030&lng=en&tlng=enInteger Linear ProgrammingTraffic Re-Grooming ProblemCarrier EthernetWDM Optical Network
collection DOAJ
language English
format Article
sources DOAJ
author Leandro Colombi Resendo
spellingShingle Leandro Colombi Resendo
Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical Network
Journal of Microwaves, Optoelectronics and Electromagnetic Applications
Integer Linear Programming
Traffic Re-Grooming Problem
Carrier Ethernet
WDM Optical Network
author_facet Leandro Colombi Resendo
author_sort Leandro Colombi Resendo
title Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical Network
title_short Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical Network
title_full Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical Network
title_fullStr Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical Network
title_full_unstemmed Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical Network
title_sort optimal traffic re-grooming model for heterogeneous carrier ethernet services over wdm optical network
publisher Sociedade Brasileira de Microondas e Optoeletrônica; Sociedade Brasileira de Eletromagnetismo
series Journal of Microwaves, Optoelectronics and Electromagnetic Applications
issn 2179-1074
description This paper proposes three novel integer linear programming (ILP) formulations, where the first model deals with the Grooming, Routing, Wavelength Assignment, and Carrier Ethernet Interface Allocation Problem (GRWA-I); the second to Traffic Re-Grooming Problem (TRGP) to accommodate demand changes in a GRWA-I network scenarios; and the third to Traffic Re-Grooming demands in case of failures. The traffic re-grooming problem consists basically in assigning demands change in a working network, without affect others requests. In addition, in this work, it problem is formulated for the first time using ILP model. As TRGP needs a configured network scenario as input parameter, the first model proposed accomplish this task for the first network scenario. In numerical results, it was used a 14-node network (NSFnet) and 6 traffic matrix. Moreover, the models proposed were compared with a shortest path (SP) routing method. Results show the difference for network cost between an optimal method and a heuristic design over time, as well as the importance of an initial optimal configuration for future network growth.
topic Integer Linear Programming
Traffic Re-Grooming Problem
Carrier Ethernet
WDM Optical Network
url http://www.scielo.br/scielo.php?script=sci_arttext&pid=S2179-10742013000200030&lng=en&tlng=en
work_keys_str_mv AT leandrocolombiresendo optimaltrafficregroomingmodelforheterogeneouscarrierethernetservicesoverwdmopticalnetwork
_version_ 1725162718670880768