QoS Anycast Routing Algorithm Based on Adaptive Nodes Selection Ant Colony Algorithm

Ant colony algorithm is easy to fall in local best and its convergent speed is slow in solving multiple QoS constrained anycast routing problems.Therefore,an adaptive nodes selection ant colony algorithm is proposed in this paper to solve the problems.The nodes selection strategy is adjusted adaptively according to the solution.Stagnation behavior is judged by the concentration level of the pheromone on the path.Chaos perturbation is utilized to update the pheromone trail on the path in order that solutions which may fall into local optimum can range out of local best.According to simulations,Its global search is strong and it can range out of local best and it is fast convergence to the global optimum.The improved algorithm is feasible and effective.