The Research Of Routing Techniques Based On Ant Colony Optimization Algorithm

In the current network, with the increase of real-time business which needs to be deal with, network quality of service problems are concerned increasingly. As an important aspect of network data transmission, routing problem is directly related to overall network. Good routing can improve the performance of network, and vice versa. The study of quality of service (QoS) routing problem that include of delay, delay jitter, bandwidth, packet loss rate and minimum cost and other constraints, has becomes the main direction of network technology research. At present, mainly use the heuristic algorithm, thus as ant colony algorithm to solve the QoS routing problem. Ant colony algorithm play an important role in solving complex NP-complete problems by it's the advantages of excellent adaptability, strong portability, the nature of parallelism, easy-to-combining with other algorithms.In this paper, I proposed an algorithm named dynamic self-adaptive ant colony algorithm (DAAO) by in-depth study of basic ant colony algorithm, and the article has made a detailed analysis and design on how to use it to solve the QoS multicast routing problem, and simulated the problem solving process by abstracted the real network topology into a weighted undirected connected graph. The simulation results show that the algorithm is correct, and effective for solving QoS routing problem.