Paper Info
Title
On QoS Anycast Routing Algorithm based on Particle Swarm Optimization
Abstract
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.
Year
DOI
Venue
2008
10.1109/ICYCS.2008.287
ICYCS
Keywords
Field
DocType
fitness function,ip networks,anycast routing,quality of service,np complete problem,combination optimization,particle swarm optimisation,multiple qos constraint,nonlinear combination optimization problem,improved particle swarm optimization,qos anycast routing algorithm,anycast routing algorithm,better path,qos,global optimal path,worst path,ipv6 networks,anycast,routing,telecommunication network routing,qos anycast,particle swam optimization,global optimum,particle swarm optimization,algorithm design and analysis,global optimization,optimization,satisfiability,bandwidth,optimization problem
Particle swarm optimization,IPv6,Mathematical optimization,Algorithm design,Computer science,Local optimum,Quality of service,Computer network,Fitness function,Anycast,Optimization problem,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-0-7695-3398-8
2
0.42
References 
Authors
8
5
Name
Order
Citations
PageRank
Taoshen Li11914.68
Ming Yang220.42
Songqiao Chen35811.12
Zhigang Zhao440.80
Zhihui Ge5164.09