QoS Multicast Routing Problem Based on Artificial Fish-Swarm Algorithm

Author

Liu, Chun-bo ; Wang, Hui-jin ; Luo, Zhi-ping ; Yu, Xiu-qin ; Liu, Li-hua

Author_Institution

Dept of Comput., Inf. Sci. & Technol., Jinan Univ., Guangzhou

Volume

2

fYear

2009

fDate

7-8 March 2009

Firstpage

814

Lastpage

817

Abstract

Bandwidth-delay-constrained multicast routing problem is an NP-complete problem. In this paper, we propose a QoS multicast routing algorithm based on artificial fish swarm optimization. Meeting with the bandwidth-delay-constrained, the proposed algorithm can search the least-cost multicast routing tree quickly. Simulation results show that this algorithm has high reliability and good performance of global optimization, and suit for real-time, high-speed multimedia transmission network.

Keywords

Internet; computational complexity; computer network reliability; multicast communication; multimedia communication; optimisation; telecommunication network routing; Internet; NP-complete problem; QoS multicast routing problem; artificial fish-swarm algorithm; bandwidth-delay-constrained; high-speed multimedia transmission network; Bandwidth; Computer science education; Costs; Delay; Educational technology; Information science; Mathematical model; Multicast algorithms; Quality of service; Routing; QoS multicast routing problem; Steiner tree problem; artificial fish-swarm algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Education Technology and Computer Science, 2009. ETCS '09. First International Workshop on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-1-4244-3581-4

Type

conf

DOI

10.1109/ETCS.2009.443

Filename

4959157