Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiong Qin ; Sch. of Comput., Electron. & Inf., Guangxi Univ., Nanning, China ; Li Taoshen ; Ge Zhihui

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.

Published in:

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

Date of Conference:

14-17 Oct. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.