An anycast routing algorithm based on simplified particle swarm optimization and diversity strategy

To solve anycast routing problem with multiple QoS constraints, a improved anycast routing algorithm based on simplified particle swarm optimization algorithm and diversity strategy is presented. Firstly, the algorithm simplified the complexity of standard PSO algorithm and improved the convergence velocity extraordinarily by dynamically changing the inertia weight. Then, a mutation operator and diversity strategy was employed to maintain particle´s diversity and balance global and local search effectively. Finally, the validity and efficiency of the presented algorithm are demonstrated by network experiment. The experimental results show that proposed algorithm can better express the advantages of particle swarm optimization algorithm, and can meet the needs of anycast routing with multiple QoS at same time. It has faster convergence speed and can escape from local optimum.