A QoS Anycast Routing Algorithm Based on Genetic Algorithm and Particle Swarm Optimization

Author

Xiong Qin ; Li Taoshen ; Ge Zhihui

Author_Institution

Sch. of Comput., Electron. & Inf., Guangxi Univ., Nanning, China

fYear

2009

fDate

14-17 Oct. 2009

Firstpage

125

Lastpage

128

Abstract

Anycast is a new type of communication service, and has been defined as a standard communication mode of the IPv6. With the more and more application need of anycast service, anycast routing problem (ARP) has recently become an important topic to study. An anycast routing algorithm based on genetic algorithm and particle swarm optimization is proposed in this paper. The algorithm overcomes the disadvantages of GA and PSO, has faster convergence and can escape from local optimum. The simulation results show that our algorithm achieves better QoS performance and advantage over single GA and PSO algorithm.

Keywords

genetic algorithms; particle swarm optimisation; quality of service; telecommunication network routing; GA; IPv6; PSO; QoS; anycast routing problem; genetic algorithm; particle swarm optimization; Bandwidth; Communication standards; Delay; Genetic algorithms; Genetic mutations; Internet; Jitter; Particle swarm optimization; Quality of service; Routing; Anycast routing; Genetic Algorithm; Particle Swarm Optimization; Update operator;

fLanguage

English

Publisher

ieee

Conference_Titel

Genetic and Evolutionary Computing, 2009. WGEC '09. 3rd International Conference on

Conference_Location

Guilin

Print_ISBN

978-0-7695-3899-0

Type

conf

DOI

10.1109/WGEC.2009.147

Filename

5402930