On QoS Anycast Routing Algorithm based on Particle Swarm Optimization

Anycast is a new ldquoone-to-one-of-manyrdquo communication method in IPv6 networks. QoS anycast routing problem is a nonlinear combination optimization problem, which is proved to be a NP complete problem. Based on improved particle swarm optimization algorithm, an anycast routing algorithm with multiple QoS constraints is proposed. This algorithm uses a special add operator to make the worst path learning from the better path in order to approach to global optimal path. To guarantee the diversity of particles and improve the algorithmpsilas ability to skip out of local optimum, a random mutation operator is designed to mutate global optima randomly. The experimental results show that the algorithm is feasible and effective, and can satisfy the need of the user for bandwidth and delay on the basic of resource reservation.