Application of an Improved Particle Swarm Optimization Algorithm in QoS Anycast Routing
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,a QoS anycast routing algorithm 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 increase the algorithm's ability to skip out of local optimal solution quickly,a random mutation operator is designed to mutate global optima randomly. The experimental results illustrate that the algorithm is feasible and effective,and it can satisfy the need of the user for bandwidth and delay on the basic of resource reservation.