Title :
Virtual Topology Reconfiguration Problem on survivable WDM networks
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Changhua Univ. of Educ., Changhua
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.
Keywords :
communication complexity; genetic algorithms; simulated annealing; telecommunication network topology; telecommunication traffic; wavelength division multiplexing; average weighted propagation delay; genetic algorithm; polynomial time algorithm; reconfiguration constraint; simulated annealing; survivable WDM network; traffic demand matrix; virtual topology reconfiguration problem; Algorithm design and analysis; Genetic algorithms; Network topology; Polynomials; Propagation delay; Protection; Simulated annealing; Telecommunication traffic; WDM networks; Wavelength division multiplexing; WDM; dedicated path-protected; genetic algorithm; reconfiguration; simulated annealing; survivability;
Conference_Titel :
Communications and Networking in China, 2008. ChinaCom 2008. Third International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4244-2373-6
Electronic_ISBN :
978-1-4244-2374-3
DOI :
10.1109/CHINACOM.2008.4685146