Study on QoS Multicast Routing Based on ACO-PSO Algorithm

QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem. a hybrid algorithm with ant colony optimization algorithm(ACO) and particle a warm optimization algorithm(PSO) is presented. The ACO-GA algorithm absorbs the merits of ACO and GA respectively. In hybrid algorithm, the position update of PSO is used to regulate the solution generated by ACO, which can make the current solution cross with current best solution of the paricle and current best solution of all partiles respectively. In additional, the strategy of the position update in PSO is motified by some re-defined arithmetic operators. The results of test show that the hybrid algorithm can meet QoS contraints of multicast routing problem excellently, and has better performance in finding global best solution.

[1]  M. Dorigo,et al.  Aco Algorithms for the Traveling Salesman Problem , 1999 .

[2]  Qijun Gu,et al.  A heuristic ant algorithm for solving QoS multicast routing problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[3]  George C. Polyzos,et al.  Multicasting for multimedia applications , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[4]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[5]  Wang Zheng,et al.  Solving QoS Multicast Routing Problem Based on Heuristic Genetic Algorithm , 2001 .

[6]  Zhou Ri-gui,et al.  A Multicast Routing Algorithm Based on Ant Colony System , 2006 .

[7]  Ying Wang,et al.  Ant colony optimization for multicast routing , 2000, IEEE APCCAS 2000. 2000 IEEE Asia-Pacific Conference on Circuits and Systems. Electronic Communication Systems. (Cat. No.00EX394).