期刊名称：International Journal of Computer Technology and Applications
电子版ISSN：2229-6093
出版年度：2012
卷号：3
期号：3
页码：1150-1152
出版社：Technopark Publications
摘要：In recent years, Ant-based algorithms were used to solve classical routing problems such as: Traveling Salesman Problem, Vehicle Routing Problem, Quadratic Assignment Problem, connection-oriented /connectionless routing, sequential ordering, graph coloring and shortest common supersequence. In this paper we propose an ant colony optimization based, QoS routing algorithm to find multiple feasible path. In this algorithm we 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. In this paper we propose that the algorithm can find multiple feasible path between a pair of source and destination which satisfied the QoS constraints quickly, and balance network traffic reasonably. It can reduce network blocking probability and improve transmitting capacity of information like real time data or multimedia
