A RDO-PSO Algorithm for Anycast Routing with Multi-QoS Constraints
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.
Anycast QoS routing Particle swam optimization special add operator Random disturbance operator
YANG Ming LI Taoshen
School of Computer, Electronics and Information Guangxi University Nanning, China
国际会议
第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)
南京
英文
376-379
2009-07-25（万方平台首次上网日期，不代表论文的发表时间）