DocumentCode :
2029790
Title :
Probability Convergence based Particle Swarm Optimization for Multiple Constrained QoS Multicast Routing
Author :
Jin, Xing ; Bai, Lin ; Ji, Yuefeng ; Sun, Yongmei
Author_Institution :
Key Lab. of Opt. Commun. & Lightwave Technol., Beijing Univ. of Posts & Telecommun., Beijing, China
fYear :
2008
fDate :
3-5 Dec. 2008
Firstpage :
412
Lastpage :
415
Abstract :
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.
Keywords :
multicast communication; particle swarm optimisation; probability; quality of service; telecommunication network routing; global astringency; multiple constrained QoS multicast routing; particle sorting rule; particle swarm optimization; probability convergence; Bandwidth; Convergence; Cost function; Delay; Heuristic algorithms; Internet; Jitter; Multicast algorithms; Particle swarm optimization; Routing; Multicast routing; Particle swarm optimization (PSO); QoS;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Semantics, Knowledge and Grid, 2008. SKG '08. Fourth International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-0-7695-3401-5
Electronic_ISBN :
978-0-7695-3401-5
Type :
conf
DOI :
10.1109/SKG.2008.96
Filename :
4725951
Link To Document :
بازگشت