Title :
A RDO-PSO algorithm for anycast routing with multi-QoS constraints
Author :
Yang Ming ; Li Taoshen
Author_Institution :
Sch. of Comput., Electron. & Inf., Guangxi Univ., Nanning, China
Abstract :
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.
Keywords :
IP networks; particle swarm optimisation; quality of service; telecommunication network routing; IPv6; NP-complete problem; RDO-PSO algorithm; anycast routing; multiQoS constraints; particle swam optimisation; random disturbance operator; Computer networks; Computer science; Computer science education; Constraint optimization; Intelligent networks; Iterative algorithms; NP-complete problem; Network servers; Particle swarm optimization; Routing; Anycast; Particle swam optimization; QoS routing; Random disturbance operator; special add operator;
Conference_Titel :
Computer Science & Education, 2009. ICCSE '09. 4th International Conference on
Conference_Location :
Nanning
Print_ISBN :
978-1-4244-3520-3
Electronic_ISBN :
978-1-4244-3521-0
DOI :
10.1109/ICCSE.2009.5228423
