A genetic algorithm for solving virtual topology reconfiguration problem in survivable WDM networks with reconfiguration constraint

Der Rong Din, Yu Sheng Chiu

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

In wavelength division multiplexing (WDM) networks, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when fiber fails. Thus, the combination of survivability and reconfiguration is an important issue on WDM networks. In this paper, the virtual topology reconfiguration problem (VTRP) in survivable WDM networks with reconfiguration constraint is studied. Given the physical topology, dedicated path-protection virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure current virtual topology under the pre-specified reconfiguration constraint so that the objective cost can be minimized. The object cost of VTRP is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical, in this paper, a genetic algorithm (GA) is proposed to solve this problem. Experiment results reveal that the objective cost can be decreased effectively by using the proposed genetic algorithm.

Original languageEnglish
Pages (from-to)2520-2533
Number of pages14
JournalComputer Communications
Volume31
Issue number10
DOIs
Publication statusPublished - 2008 Jun 25

Fingerprint

Wavelength division multiplexing
Genetic algorithms
Topology
Costs
Polynomials
Fibers

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{05307e81e5c445d78081ac2ffbe747e9,
title = "A genetic algorithm for solving virtual topology reconfiguration problem in survivable WDM networks with reconfiguration constraint",
abstract = "In wavelength division multiplexing (WDM) networks, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when fiber fails. Thus, the combination of survivability and reconfiguration is an important issue on WDM networks. In this paper, the virtual topology reconfiguration problem (VTRP) in survivable WDM networks with reconfiguration constraint is studied. Given the physical topology, dedicated path-protection virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure current virtual topology under the pre-specified reconfiguration constraint so that the objective cost can be minimized. The object cost of VTRP is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical, in this paper, a genetic algorithm (GA) is proposed to solve this problem. Experiment results reveal that the objective cost can be decreased effectively by using the proposed genetic algorithm.",
author = "Din, {Der Rong} and Chiu, {Yu Sheng}",
year = "2008",
month = "6",
day = "25",
doi = "10.1016/j.comcom.2008.03.022",
language = "English",
volume = "31",
pages = "2520--2533",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "10",

}

A genetic algorithm for solving virtual topology reconfiguration problem in survivable WDM networks with reconfiguration constraint. / Din, Der Rong; Chiu, Yu Sheng.

In: Computer Communications, Vol. 31, No. 10, 25.06.2008, p. 2520-2533.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A genetic algorithm for solving virtual topology reconfiguration problem in survivable WDM networks with reconfiguration constraint

AU - Din, Der Rong

AU - Chiu, Yu Sheng

PY - 2008/6/25

Y1 - 2008/6/25

N2 - In wavelength division multiplexing (WDM) networks, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when fiber fails. Thus, the combination of survivability and reconfiguration is an important issue on WDM networks. In this paper, the virtual topology reconfiguration problem (VTRP) in survivable WDM networks with reconfiguration constraint is studied. Given the physical topology, dedicated path-protection virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure current virtual topology under the pre-specified reconfiguration constraint so that the objective cost can be minimized. The object cost of VTRP is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical, in this paper, a genetic algorithm (GA) is proposed to solve this problem. Experiment results reveal that the objective cost can be decreased effectively by using the proposed genetic algorithm.

AB - In wavelength division multiplexing (WDM) networks, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when fiber fails. Thus, the combination of survivability and reconfiguration is an important issue on WDM networks. In this paper, the virtual topology reconfiguration problem (VTRP) in survivable WDM networks with reconfiguration constraint is studied. Given the physical topology, dedicated path-protection virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure current virtual topology under the pre-specified reconfiguration constraint so that the objective cost can be minimized. The object cost of VTRP is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical, in this paper, a genetic algorithm (GA) is proposed to solve this problem. Experiment results reveal that the objective cost can be decreased effectively by using the proposed genetic algorithm.

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

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

U2 - 10.1016/j.comcom.2008.03.022

DO - 10.1016/j.comcom.2008.03.022

M3 - Article

VL - 31

SP - 2520

EP - 2533

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 10

ER -