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.