Research Article
An ABC Supported QoS Multicast Routing Scheme Based on Beehive Algorithm
@INPROCEEDINGS{10.4108/ICST.QSHINE2008.3900, author={Xingwei Wang and Qiang Chen and Rongzhu Zou and Min Huang}, title={An ABC Supported QoS Multicast Routing Scheme Based on Beehive Algorithm}, proceedings={5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness}, publisher={ICST}, proceedings_a={QSHINE}, year={2010}, month={5}, keywords={QoS (Quality of Service) Multicast Routing ABC (Always Best Connected) Beehive Algorithm Nash Equilibrium Pareto Optimum}, doi={10.4108/ICST.QSHINE2008.3900} }- Xingwei Wang
Qiang Chen
Rongzhu Zou
Min Huang
Year: 2010
An ABC Supported QoS Multicast Routing Scheme Based on Beehive Algorithm
QSHINE
ICST
DOI: 10.4108/ICST.QSHINE2008.3900
Abstract
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.
Copyright © 2008–2024 ICST
