An ABC supported QoS multicast routing scheme based on beehive algorithm

Authors:
Xingwei Wang;Qiang Chen;Rongzhu Zou;Min Huang
Affiliations:
Northeastern University, Shenyang, P.R. China;Northeastern University, Shenyang, P.R. China;Northeastern University, Shenyang, P.R. China;Northeastern University, Shenyang, P.R. China
Venue:
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Year:
2008

Citing 9
Cited 0

QoS routing in networks with uncertain parameters

IEEE/ACM Transactions on Networking (TON)
Congestion control for fair resource allocation in networks with multicast flows

IEEE/ACM Transactions on Networking (TON)
A Fair QoS Multicast Routing Scheme for IP/DWDM Optical Internet

ICDCSW '05 Proceedings of the Third International Workshop on Mobile Distributed Computing - Volume 06
A QoS multicast routing protocol for dynamic group topology

Information Sciences: an International Journal
Genetic algorithm-based QoS multicast routing for uncertainty in network parameters

APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
On efficient distribution of data in multicast networks: QoS in scalable networks

LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Always best connected

IEEE Wireless Communications
A fuzzy genetic algorithm for QoS multicast routing

Computer Communications
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.