An Cross-Entropy Algorithm for multi-Constraints QoS Multicast Routing

Liansheng Ge; Gang Wang; Zhao Shi

2nd International ICST Conference on Communications and Networking in China

Research Article

An Cross-Entropy Algorithm for multi-Constraints QoS Multicast Routing

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2007.4469370,
    author={Liansheng Ge and Gang Wang and Zhao Shi},
    title={An Cross-Entropy Algorithm for multi-Constraints QoS Multicast Routing},
    proceedings={2nd International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2008},
    month={3},
    keywords={Ant colony optimization  Application software  Bandwidth  Computer science  Costs  Mathematical model  Mathematics  Multicast algorithms  Propagation losses  Routing},
    doi={10.1109/CHINACOM.2007.4469370}
}

Liansheng Ge
Gang Wang
Zhao Shi
Year: 2008
An Cross-Entropy Algorithm for multi-Constraints QoS Multicast Routing
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2007.4469370

Liansheng Ge^1,2^,*, Gang Wang¹^,*, Zhao Shi¹^,*

1: School of Computer Science and Technology, Shandong University, Jinan, Shandong Province, P. R. China
2: Network Center, Shandong University, Jinan, Shandong Province, P. R. China

*Contact email: lsge@sdu.edu.cn, gwang@sdu.edu.cn, shizhao@sdu.edu.cn

Abstract

Many applications in the network like multimedia transmission have strict demands for QoS, such as bandwidth, delay, packet loss rate, etc. Finding the multicast tree that satisfies those requirements is an NP-complete problem. Among the existing algorithms for multi-constraints QoS multicast are local search algorithms or centralized algorithms, which cannot guarantee the finding of global solutions in real network. In this paper, we propose an ant colony algorithm based on cross- entropy for multi-constraints QoS multicast routing. Simulation results in NS-2 environment indicate that this algorithm can quickly find the close-to-the-best solution.

Keywords: Ant colony optimization Application software Bandwidth Computer science Costs Mathematical model Mathematics Multicast algorithms Propagation losses Routing

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

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

An Cross-Entropy Algorithm for multi-Constraints QoS Multicast Routing

Abstract

About EAI

Community

Publish with EAI