an abc supported qos multicast routing scheme based on beehive algorithm
In this paper, a QoS multicast routing scheme with ABC (Always Best Connected) supported is proposed based on the beehive algorithm. To deal with the inaccurate network status and the imprecise user QoS requirement, the proposed scheme uses the range to describe them, introduces the edge bandwidth pricing, the edge evaluation and the tree evaluation, and 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.
beehive algorithm abc (always best connected) pareto optimum nash equilibrium