Title :
Particle Swarm Optimization Based QoS Multicast Routing Scheme with ABC Supported
Author :
Wang Xing-Wai ; Hai-Quan, Yang ; Min, Huang
Author_Institution :
Coll. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China
Abstract :
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.
Keywords :
Pareto optimisation; fuzzy set theory; game theory; multicast communication; particle swarm optimisation; probability; quality of service; telecommunication network routing; trees (mathematics); Nash equilibrium; Pareto optimum; QoS multicast routing scheme; QoS multicast tree; always best connected concept; fuzzy mathematics; gaming theory; particle swarm optimization; probability theory; quality of service; Bandwidth; Costs; Educational institutions; Error analysis; Information science; Particle swarm optimization; Quality of service; Resonance light scattering; Routing; Switches;
Conference_Titel :
Natural Computation, 2009. ICNC '09. Fifth International Conference on
Conference_Location :
Tianjin
Print_ISBN :
978-0-7695-3736-8
DOI :
10.1109/ICNC.2009.62
