A RDO-PSO algorithm for anycast routing with multi-QoS constraints
Ming Yang, Taoshen Li · 2009
Anycast is a new network service that is proposed in IPv6, and it can balance the load of network effectively. In this paper, we study the anycast routing problem with multiple QoS constraints which is known to be NP-complete problem, and propose a intelligent anycast routing algorithm based on PSO algorithm to optimize network resource and balance network load. This algorithm uses a special add operator to solve the problem which the path with poor fitness can learn from the path with better fitness, and brings a random disturbance operator into PSO algorithm in order to avoid PSO algorithm plunged into local optimum. The simulation experiments illustrate that the algorithm is feasible and effective. It can jump local optimal quickly and guarantee the diversity of the particle.