DocumentCode
2034040
Title
An SFL-Based Multicast Routing Optimization Algorithm
Author
Sun, Xia ; Wang, Ziqiang
Author_Institution
Sch. of Inf. Sci. & Eng., Henan Univ. of Technol., Zhengzhou
fYear
2009
fDate
23-24 May 2009
Firstpage
1
Lastpage
4
Abstract
The problem of computing the bandwidth-delay-constrained least-cost QoS multicast routing is a NP-complete problem. A novel shuffled frog leaping (SFL) algorithm is proposed to deal with the Qos multicast routing problem effectively and efficiently in this paper. The experimental results show that the proposed algorithm can find optimal solution quickly and has a good scalability.
Keywords
computational complexity; multicast communication; optimisation; quality of service; telecommunication network routing; NP-complete problem; QoS; bandwidth-delay; constrained least-cost quality of service; multicast routing optimization algorithm; Application software; Costs; Delay; Information science; Multicast algorithms; Particle swarm optimization; Quality of service; Routing; Scalability; Streaming media;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-3893-8
Electronic_ISBN
978-1-4244-3894-5
Type
conf
DOI
10.1109/IWISA.2009.5072730
Filename
5072730
Link To Document