Research Article
Virtual Topology Reconfiguration Problem on Survivable WDM Networks
@INPROCEEDINGS{10.1109/CHINACOM.2008.4685146, author={Der-Rong Din}, title={Virtual Topology Reconfiguration Problem on Survivable WDM Networks}, proceedings={ChinaCom2008-Optical Communications and Networking Symposium}, publisher={IEEE}, proceedings_a={CHINACOM2008-OCN}, year={2008}, month={11}, keywords={WDM survivability reconfiguration simulated annealing genetic algorithm dedicated path-protected}, doi={10.1109/CHINACOM.2008.4685146} }- Der-Rong Din
Year: 2008
Virtual Topology Reconfiguration Problem on Survivable WDM Networks
CHINACOM2008-OCN
IEEE
DOI: 10.1109/CHINACOM.2008.4685146
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.
