Title :
ABC Supporting QoS Unicast Routing Scheme with Particle Swarm Optimization
Author :
Wang Xing-Wei ; Yang Hai-Quan ; Huang Min ; Guo, Lei
Author_Institution :
Coll. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China
Abstract :
In this paper, a QoS unicast routing scheme with ABC supported is proposed. With gaming analysis and particle swarm optimization algorithm, it tries to find a QoS unicast path with Pareto optimum under 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; game theory; particle swarm optimisation; quality of service; telecommunication network routing; ABC; Nash equilibrium; Pareto optimum; QoS unicast routing scheme; always best connected concept; gaming analysis; particle swarm optimization; Bandwidth; Database systems; Deductive databases; Delay; Error analysis; Nash equilibrium; Particle swarm optimization; Routing; Switches; Unicast; Always Best Connected; Nash Equilibrium; Pareto Optimum; Partical Swarm Optimization Algorithm; QoS Unicast Routing;
Conference_Titel :
Intelligent Information and Database Systems, 2009. ACIIDS 2009. First Asian Conference on
Conference_Location :
Dong Hoi
Print_ISBN :
978-0-7695-3580-7
DOI :
10.1109/ACIIDS.2009.37
