DocumentCode
2270609
Title
Chaos ant colony optimization algorithm for the multi-QoS constraint multicast routing problem
Author
Hao, Yang ; Zheng-Zheng, Xian ; Zhiguang, Qin
Author_Institution
Coll. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fYear
2010
fDate
28-30 July 2010
Firstpage
190
Lastpage
192
Abstract
The multicast routing technology with multi-QoS constraint is the key for distributed multimedia on the network. In this routing scheme, ant colony algorithm is one of the best algorithms for solving this problem, but it takes too much time to converge. Therefore, an improved ant colony algorithm was proposed. The algorithm utilizes the pheromone positive feedback effect to guide chaos search. The advantage of this scheme is that chaos initialization is adopted to improve individual quality and chaos perturbation is utilized to avoid the search being trapped in local optimum, meanwhile improve the packet delivery ratio and reduce the end-to-end delay. The experimental results show that the efficiency of the algorithm.
Keywords
chaos; constraint handling; multicast communication; multimedia computing; optimisation; quality of service; search problems; telecommunication network routing; ant colony optimization; chaos perturbation; chaos search; distributed multimedia; end-to-end delay; multi-QoS constraint; multicast routing technology; packet delivery ratio; pheromone positive feedback; quality of service; Chaotic communication; Quality of service;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Circuits and Systems (ICCCAS), 2010 International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-8224-5
Type
conf
DOI
10.1109/ICCCAS.2010.5582013
Filename
5582013
Link To Document