QoS Multicast Routing Based on Particle Swarm Optimization

The purpose of this paper is to solve Quality-of-Service (QoS) multicast routing problem by Particle Swarm Optimization (PSO). The QoS multicast routing optimization problem was transformed into a quasi-continuous problem by constructing a new integer coding and the constrained conditions in the problem were solved by the method of penalty function. The experimental results indicated that the proposed algorithm could converge to the optimal on near-optimal solution with less computational cost. It also appeared that PSO outperformed Genetic Algorithm on QoS the tested multicast routing problem.

[1]  Peter J. Angeline,et al.  Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences , 1998, Evolutionary Programming.

[2]  Abhishek Roy,et al.  QM2RP: A QoS-Based Mobile Multicast Routing Protocol Using Multi-Objective Genetic Algorithm , 2004, Wirel. Networks.

[3]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[4]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[5]  J. Kennedy,et al.  Stereotyping: improving particle swarm performance with cluster analysis , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[6]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[8]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.