Chaos Ant Colony Optimization Algorithm for the Multi-QoS Constraint Multicast Routing Problem
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.
Yang Hao Xian Zheng-Zheng Qin Zhiguang
College of Computer Science and Engineering, University of Electronic Science and Technology of Chin Guang Dong University of Finance, Guangzhou, Guangdong, china College of Computer Science and Engineering, University of Electronic Science and Technology of Chin
国际会议
2010 International Conference on Communications,Circuits and Systems(2010年通信、电路与系统国际会议)
成都
英文
190-192
2010-06-28(万方平台首次上网日期,不代表论文的发表时间)