An Efficient Ant Colony Algorithm for QoS Anycast Routing
Anycast communication is a new Internet service defined in IPv6, and it can make a host communication with the one nearest member in a group of servers. The anycast routing problem with multiple QoS constrained is known to be NPcomplete problem and we cant get satisfying results when using the precise method in polynomial time. In this paper, a QoS anycast routing algorithm based on ant colony algorithm is proposed. In order to search a reasonable anycast routing path, a felicitous estimate method of the optimization path is designed and the load balance is considered. By adjusting the pheromone in the iteration-best path and re-initializing the algorithm, this algorithm can efficiently avoid falling into local optimal path and enlarge global searching. The experimental results show that this algorithm can effectively find the global-best solution that satisfied the QoS constraint and balance the load of networks, and has better performance and efficiency.
ant colony algorithm anycast QoS routing load balance
XIAO Meng LI Taoshen
School of Computer, Electronics and Information Guangxi University Nanning, China
国际会议
第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)
南京
英文
135-138
2009-07-25（万方平台首次上网日期，不代表论文的发表时间）