Performance Comparison of Genetic Algorithm and Particle Swarm Optimization on QoS Multicast Routing Problem
QoS multicast routing in networks is a very important research issues in the areas of networks and distributed systems. This is also a challenging and hard problem for the next generation Internet a high-performance networks.Because of its NP-completeness, many heuristics such as Genetic Algorithms are employed solve the problem. This paper proposes an Improved PSO (IPSO) and present how to solve QoS multicast routing problem by IPSO. The proposed algorithm converts the QoS multicast routing problem into an integer-programming problem. We test IPSO-base routing algorithm on a network model. For performance comparison, we also test Particle Swarm Optimization (PSO)algorithm and GA. The experiment results show the availability and efficiency of IPSO on the problem and its superiority to PSO and GA.
Multicast routing QoS routing optimization Particle swarm optimization algorithms PSO
Jie Qin Jing Liu Wenbo Xu
School of Information Technology, Southern Yangtze University No.1800, Lihudadao Road, Wuxi 214122, Jiangsu, China
国际会议
杭州
英文
1140-1143
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）