Improved Anycast QoS Routing Algorithm Based on Genetic Algorithm
To overcome the problem of tending to converge to part in anycast QoS routing algorithm based on genetic algorithm, the paper proposes a new improved anycast QoS routing algorithm based on genetic algorithm which adopts the idea of dissimilarity and the theory of simulated annealing. The result of the simulation shows that this algorithm has a good ability of global search, and it can also efficiently and quickly find a set of low-cost paths with delay constraint. By comparing the simulation data to prove that the algorithm has a faster convergence rate, and improved the success rate of finding the optimal solution.
anycast genetic algorithm dissimilarity QoS
Shi Rui Bai Chen-Xi Shen Shi-Lei He Xin
Computing Center Henan University Kaifeng, P.R.China Computing Center Henan University Kaifeng, P.R.China School of Electronic and Information Engineerin
国际会议
太原
英文
167-170
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）