Solving virtual topology reconfiguration problem on survivable WDM networks by using simulated annealing and genetic algorithms

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology (VT) designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration (VTR). Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and reconfiguration is an important issue in WDM networks. In this paper, the Virtual Topology Reconfiguration Problem (VTRP) in survivable WDM networks with a reconfiguration constraint is studied. Given the physical topology, dedicated path-protection VT, and a new traffic demand matrix, the goal of VTRP is to reconfigure the current VT under the pre-specified reconfiguration constraint so that the objective value 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 simulated annealing (SA) algorithm and a genetic algorithm (GA) are proposed to solve this problem. Experimental results of these algorithms are also given.

Original languageEnglish
Pages (from-to)1-13
Number of pages13
JournalPhotonic Network Communications
Volume18
Issue number1
DOIs
Publication statusPublished - 2009 Aug 1

Fingerprint

simulated annealing
wavelength division multiplexing
Simulated annealing
Wavelength division multiplexing
genetic algorithms
topology
Genetic algorithms
Topology
traffic
polynomials
Polynomials
costs
fibers
propagation
Fibers
matrices

All Science Journal Classification (ASJC) codes

  • Software
  • Atomic and Molecular Physics, and Optics
  • Hardware and Architecture
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{a2983006d3b24a4d98b74a088069129a,
title = "Solving virtual topology reconfiguration problem on survivable WDM networks by using simulated annealing and genetic algorithms",
abstract = "In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology (VT) designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration (VTR). Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and reconfiguration is an important issue in WDM networks. In this paper, the Virtual Topology Reconfiguration Problem (VTRP) in survivable WDM networks with a reconfiguration constraint is studied. Given the physical topology, dedicated path-protection VT, and a new traffic demand matrix, the goal of VTRP is to reconfigure the current VT under the pre-specified reconfiguration constraint so that the objective value 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 simulated annealing (SA) algorithm and a genetic algorithm (GA) are proposed to solve this problem. Experimental results of these algorithms are also given.",
author = "Der-Rong Din",
year = "2009",
month = "8",
day = "1",
doi = "10.1007/s11107-008-0165-7",
language = "English",
volume = "18",
pages = "1--13",
journal = "Photonic Network Communications",
issn = "1387-974X",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Solving virtual topology reconfiguration problem on survivable WDM networks by using simulated annealing and genetic algorithms

AU - Din, Der-Rong

PY - 2009/8/1

Y1 - 2009/8/1

N2 - In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology (VT) designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration (VTR). Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and reconfiguration is an important issue in WDM networks. In this paper, the Virtual Topology Reconfiguration Problem (VTRP) in survivable WDM networks with a reconfiguration constraint is studied. Given the physical topology, dedicated path-protection VT, and a new traffic demand matrix, the goal of VTRP is to reconfigure the current VT under the pre-specified reconfiguration constraint so that the objective value 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 simulated annealing (SA) algorithm and a genetic algorithm (GA) are proposed to solve this problem. Experimental results of these algorithms are also given.

AB - In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology (VT) designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration (VTR). Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and reconfiguration is an important issue in WDM networks. In this paper, the Virtual Topology Reconfiguration Problem (VTRP) in survivable WDM networks with a reconfiguration constraint is studied. Given the physical topology, dedicated path-protection VT, and a new traffic demand matrix, the goal of VTRP is to reconfigure the current VT under the pre-specified reconfiguration constraint so that the objective value 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 simulated annealing (SA) algorithm and a genetic algorithm (GA) are proposed to solve this problem. Experimental results of these algorithms are also given.

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

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

U2 - 10.1007/s11107-008-0165-7

DO - 10.1007/s11107-008-0165-7

M3 - Article

VL - 18

SP - 1

EP - 13

JO - Photonic Network Communications

JF - Photonic Network Communications

SN - 1387-974X

IS - 1

ER -