An Improved Ant Colony Optimization Algorithm for Anycast Routing with QoS Constraints

摘要：

The QoS anycast routing is known to be NP-complete problem. In this paper, a QoS anycast routing algorithm based on ant colony optimization is proposed. This algorithm regulates the pheromone on the best path and adopts resetting method and candidate set strategy to avoid falling into local optimal path and expand searching space of ant colony. The simulation results show that the algorithm can find the global-best solution satisfied the QoS constraints quickly, and balance network traffic reasonably. It can reduce network blocking probability and improve transmitting capacity of multimedia information.

作者: Taoshen Li Meng.Xiao Songqiao Chen

作者单位: School of Computer and Electronic Engineering, Guangxi Universityr, 530004 Nanning, Chian School of Computer and Electronic Engineering, Guangxi Universityr, 530004 Nanning, China School of Information Science and Engineering, Central South University, 4100083 Changsha, China

会议类型: 国际会议

会议名称: Third International Symposium on Intelligence Computation and Applications(ISICA 2008)(第三届智能自动化、计算与制造国际研讨会)

会议地点: 武汉

会议语种:英文

页码: 176-179

在线出版日期: 2008-12-19（万方平台首次上网日期，不代表论文的发表时间）