Application of a Parallel Quantum Genetic Algorithm in Multicast Routing Optimization with QoS Constraints
Rao Lin-guo · Computer Technology and Development · 2008
Along with the developing of telecommunication technology and prevailing of the Internet,multicast routing with excellent performance becomes more and more important nowadays.The notable multicast routing problem named Steiner tree problem is an NP-complete problem and should be solved by heuristic methods.In this paper,a parallel evolution model is introduced into general quantum genetic algorithm,and a new algorithm is proposed to solve multicast routing optimization problem with multiple QoS constraints.This new algorithm can search out minimum cost multicast tree satisfying bandwidth,delay-constraints while correctly arranging nodes' loads and decreasing communication spending.The simulation results show that this new algorithm has fast search speed and finer global search capacity.Its performance and efficiency is better than general quantum genetic algorithm.