The Multicast Routing QoS Based on the Improved ACO Algorithm

Abstract

For the search of the optimal path and the establishment of the multicast tree which meets QoS constraints in multicast routing, an improved ant colony algorithm is proposed in the paper. In the searching process, two group ants carry out searching separately and alternate information after one search. After a period of time, the rotary table is adapted to choosing a path and avoids stagnation, and the optimal one is selected from the two paths by combining with multi-constrained QoS. At the same time, in the choice of the next node, the probability of previous search on the path is introduced to speed up the search. Experiments show that the algorithm has a better performance than the other routing algorithm and establish the multicast tree quickly.