An Improved Discrete PSO with GA Operators for Efficient QoS-Multicast Routing
QoS multicast routing is a non-linear combinatorial optimization problem that arises in many multimedia applications. Providing QoS support is crucial to guarantee effective transportation of multimedia service in multicast communication. Computing the bandwidth delay 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 is proposed. The algorithm applies the discrete Particle Swarm Optimization (PSO) algorithm to optimally search the solution space for the optimal multicast tree which satisfies the QoS requirement. New PSO operators have been introduced to modify the original PSO velocity and position update rules to adapt to the discrete solution space of the multicast routing problem.
Provided by: Science and Development Network (SciDev.Net) Topic: Networking Date Added: Apr 2011 Format: PDF