DocumentCode :
2939393
Title :
An ABC Supported QoS Multicast Routing Scheme Based on Ant Algorithm
Author :
Wang, Xingwei ; Zou, Rongzhu ; Huang, Min
Author_Institution :
Coll. of Inf. Sci. & Eng., Northeastern Univ., Shenyang
Volume :
3
fYear :
2009
fDate :
6-8 Jan. 2009
Firstpage :
222
Lastpage :
226
Abstract :
In this paper, a QoS multicast routing scheme with ABC (always best connected) supported is proposed based on the ant algorithm. To deal with the inaccurate network status and the imprecise user QoS requirement, it 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.
Keywords :
Pareto analysis; multicast communication; quality of service; telecommunication channels; telecommunication network routing; Nash equilibrium; Pareto optimum; always best connected; ant algorithm; edge bandwidth pricing; edge evaluation; imprecise user QoS requirement; inaccurate network status; multicast routing; network provider utility; tree evaluation; Bandwidth; Delay effects; Error analysis; Jitter; Mobile communication; Mobile computing; Multicast algorithms; Resonance light scattering; Routing; Tree graphs; ABC (Always Best Connected); Multicast routing; QoS (Quality of Service); ant algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on
Conference_Location :
Yunnan
Print_ISBN :
978-0-7695-3501-2
Type :
conf
DOI :
10.1109/CMC.2009.257
Filename :
4797251
Link To Document :
بازگشت