期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2011
卷号：4
期号：2
出版社：SERSC
摘要：QoS multicast routing is a non linear combinatorial optimization problem that arises inmany multimedia applications. Providing QoS support is crucial to guarantee effectivetransportation of multimedia service in multicast communication. Computing the band widthdelay constrained least cost multicast routing tree is an NP complete problem. In this paper,a novel heuristic QoS multicast routing algorithm with bandwidth and delay constraints isproposed. The algorithm applies the discrete particle swarm optimization (PSO) algorithm tooptimally search the solution space for the optimal multicast tree which satisfies the QoSrequirement. New PSO operators have been introduced to modify the original PSO velocityand position update rules to adapt to the discrete solution space of the multicast routingproblem. A new adjustable PSO GA hybrid multicast routing algorithm which combines PSOwith genetic operators was proposed. The proposed hybrid technique combines the strengthsof PSO and GA to realize the balance between natural selection and good knowledge sharingto provide robust and efficient search of the solution space. Two driving parameters areutilized in the adjustable hybrid model to optimize the performance of the PSO GA hybrid bygiving preference to either PSO or GA. Simulation results show that with the correctcombination of GA and PSO the hybrid algorithm outperforms both the standard PSO andGA models. The flexibility in the choice of parameters in the hybrid algorithm improves theability of the evolutionary operators to generate strong developing individuals that canachieve faster convergence and avoids premature convergence to local optima
