By Topic

Probability Convergence based Particle Swarm Optimization for Multiple Constrained QoS Multicast Routing

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
$33 $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

4 Author(s)
Xing Jin ; Key Lab. of Opt. Commun. & Lightwave Technol., Beijing Univ. of Posts & Telecommun., Beijing, China ; Lin Bai ; Yuefeng Ji ; Yongmei Sun

In this paper, we proposed a novel probability convergence based particle swarm optimization algorithm for the multiple constrained QoS multicast routing. This algorithm is inspired from the probability convergence attributes. The main contents of this paper includes: (1) A novel particle sorting rule of swarm are designed. (2) A novel probability convergence mechanism is developed in the position updating phase. (3) A new anti-congestion tactic is introduced. Experiment result shows that the new algorithm has excellent performance in convergence speed and global astringency.

Published in:

Semantics, Knowledge and Grid, 2008. SKG '08. Fourth International Conference on

Date of Conference:

3-5 Dec. 2008