An Improved Ant Colony Optimization Algorithm for Multiple QoS Anycast Routing
Anycast communication has been defined as a standard communication model of IPv6. The anycast routing problem with multiple QoS constrained is known to be NP-complete 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 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.
Ant colony optimization Anycast Quality of service (QoS) Routing
LI Taoshen XIAO Meng
School of Computer, Electronics and Information Guangxi University Nanning, China
国际会议
成都
英文
544-547
2010-06-12（万方平台首次上网日期，不代表论文的发表时间）