Virtual topology reconfiguration problem on survivable WDM networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, the Virtual Topology Reconfiguration Problem (VTRP) on survivable WDM networks with reconfiguration constraint is studied. Given a physical topology, a dedicated path-protected virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure the current virtual topology under the pre-specified reconfiguration constraint such that the objective value can be minimized. The objective value considered in this paper is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical when the reconfiguration constraint is larger. In this paper, a simulated annealing (SA) and a genetic algorithm (GA) are proposed to solve this problem. Experiment results of these algorithms are also given.

Original languageEnglish
Title of host publication3rd International Conference on Communications and Networking in China, ChinaCom 2008
Pages804-808
Number of pages5
DOIs
Publication statusPublished - 2008 Dec 1
Event3rd International Conference on Communications and Networking in China, ChinaCom 2008 - Hangzhou, China
Duration: 2008 Aug 252008 Aug 27

Publication series

Name3rd International Conference on Communications and Networking in China, ChinaCom 2008

Other

Other3rd International Conference on Communications and Networking in China, ChinaCom 2008
CountryChina
CityHangzhou
Period08-08-2508-08-27

Fingerprint

Wavelength division multiplexing
Topology
Values
traffic
Simulated annealing
demand
experiment
Genetic algorithms
Polynomials
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Cite this

Din, D. R. (2008). Virtual topology reconfiguration problem on survivable WDM networks. In 3rd International Conference on Communications and Networking in China, ChinaCom 2008 (pp. 804-808). [4685146] (3rd International Conference on Communications and Networking in China, ChinaCom 2008). https://doi.org/10.1109/CHINACOM.2008.4685146
Din, Der Rong. / Virtual topology reconfiguration problem on survivable WDM networks. 3rd International Conference on Communications and Networking in China, ChinaCom 2008. 2008. pp. 804-808 (3rd International Conference on Communications and Networking in China, ChinaCom 2008).
@inproceedings{fb72d1e804ce43f38b23e7ce39402697,
title = "Virtual topology reconfiguration problem on survivable WDM networks",
abstract = "In this paper, the Virtual Topology Reconfiguration Problem (VTRP) on survivable WDM networks with reconfiguration constraint is studied. Given a physical topology, a dedicated path-protected virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure the current virtual topology under the pre-specified reconfiguration constraint such that the objective value can be minimized. The objective value considered in this paper is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical when the reconfiguration constraint is larger. In this paper, a simulated annealing (SA) and a genetic algorithm (GA) are proposed to solve this problem. Experiment results of these algorithms are also given.",
author = "Din, {Der Rong}",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/CHINACOM.2008.4685146",
language = "English",
isbn = "9781424423736",
series = "3rd International Conference on Communications and Networking in China, ChinaCom 2008",
pages = "804--808",
booktitle = "3rd International Conference on Communications and Networking in China, ChinaCom 2008",

}

Din, DR 2008, Virtual topology reconfiguration problem on survivable WDM networks. in 3rd International Conference on Communications and Networking in China, ChinaCom 2008., 4685146, 3rd International Conference on Communications and Networking in China, ChinaCom 2008, pp. 804-808, 3rd International Conference on Communications and Networking in China, ChinaCom 2008, Hangzhou, China, 08-08-25. https://doi.org/10.1109/CHINACOM.2008.4685146

Virtual topology reconfiguration problem on survivable WDM networks. / Din, Der Rong.

3rd International Conference on Communications and Networking in China, ChinaCom 2008. 2008. p. 804-808 4685146 (3rd International Conference on Communications and Networking in China, ChinaCom 2008).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Virtual topology reconfiguration problem on survivable WDM networks

AU - Din, Der Rong

PY - 2008/12/1

Y1 - 2008/12/1

N2 - In this paper, the Virtual Topology Reconfiguration Problem (VTRP) on survivable WDM networks with reconfiguration constraint is studied. Given a physical topology, a dedicated path-protected virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure the current virtual topology under the pre-specified reconfiguration constraint such that the objective value can be minimized. The objective value considered in this paper is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical when the reconfiguration constraint is larger. In this paper, a simulated annealing (SA) and a genetic algorithm (GA) are proposed to solve this problem. Experiment results of these algorithms are also given.

AB - In this paper, the Virtual Topology Reconfiguration Problem (VTRP) on survivable WDM networks with reconfiguration constraint is studied. Given a physical topology, a dedicated path-protected virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure the current virtual topology under the pre-specified reconfiguration constraint such that the objective value can be minimized. The objective value considered in this paper is the average weighted propagation delay (AWPD). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical when the reconfiguration constraint is larger. In this paper, a simulated annealing (SA) and a genetic algorithm (GA) are proposed to solve this problem. Experiment results of these algorithms are also given.

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

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

U2 - 10.1109/CHINACOM.2008.4685146

DO - 10.1109/CHINACOM.2008.4685146

M3 - Conference contribution

AN - SCOPUS:58049133714

SN - 9781424423736

T3 - 3rd International Conference on Communications and Networking in China, ChinaCom 2008

SP - 804

EP - 808

BT - 3rd International Conference on Communications and Networking in China, ChinaCom 2008

ER -

Din DR. Virtual topology reconfiguration problem on survivable WDM networks. In 3rd International Conference on Communications and Networking in China, ChinaCom 2008. 2008. p. 804-808. 4685146. (3rd International Conference on Communications and Networking in China, ChinaCom 2008). https://doi.org/10.1109/CHINACOM.2008.4685146