Particle Swarm Optimization Based QoS Multicast Routing Scheme with ABC Supported

In this paper, by introducing the knowledge of the fuzzy mathematics, probability theory and gaming theory, a QoS (quality of service) multicast routing scheme with ABC (always best connected) supported is proposed. It uses the interval to describe the user QoS requirement and the edge (link) parameter, introducing the user satisfaction degree, edge evaluation and solution quality comparison. With the help of the gaming analysis and based on the particle swarm optimization algorithm, it tries to find a QoS multicast tree with the Pareto optimum under the Nash equilibrium on both the network provider utility and the user utility achieved or approached. Simulation results have shown that it is both feasible and effective.