A GAME THEORY AND BCC BASED FLEXIBLE QOS MULTICAST ROUTING SCHEME

Xingwei Wang; Lin Han; Min Huang

2nd International ICST Conference on Communications and Networking in China

Research Article

A GAME THEORY AND BCC BASED FLEXIBLE QOS MULTICAST ROUTING SCHEME

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2007.4469332,
    author={Xingwei Wang and Lin Han and Min Huang},
    title={A GAME THEORY AND BCC BASED FLEXIBLE QOS MULTICAST ROUTING SCHEME},
    proceedings={2nd International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2008},
    month={3},
    keywords={NGI  Nash equilibrium  Pareto optimum  QoS multicast routing  bacterial colony chemotaxis algorithm},
    doi={10.1109/CHINACOM.2007.4469332}
}

Xingwei Wang
Lin Han
Min Huang
Year: 2008
A GAME THEORY AND BCC BASED FLEXIBLE QOS MULTICAST ROUTING SCHEME
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2007.4469332

Xingwei Wang¹^,*, Lin Han¹, Min Huang¹

1: School of Information Science and Engineering Northeastern University Shenyang, Liaoning, China

*Contact email: wangxw@mail.neu.edu.cn

Abstract

In this paper, the knowledge of the fuzzy mathematics, game theory and swarm intelligence computing method is introduced to design a flexible QoS multicast routing scheme. Based on BCC (Bacteria Colony Chemotaxis), it searches for a QoS multicast tree with Pareto optimum under Nash equilibrium between the network provider utility and the user utility achieved or approached. Simulation results have shown that the proposed scheme is both feasible and effective with better performance.

Keywords: NGI Nash equilibrium Pareto optimum QoS multicast routing bacterial colony chemotaxis algorithm

Published: 2008-03-07
Publisher: IEEE
Modified: 2011-07-12

: http://dx.doi.org/10.1109/CHINACOM.2007.4469332