Research Of Multiple Constrained Distributed Qos Routing Based On Improved Ant Colony Algorithm

A dynamic adaptive Max-Min ant colony algorithm is proposed by this paper. The improved algorithm is based on the Max-Min ant colony algorithm, and does the dynamically adaptive adjustment on pheromone evaporation coefficient, expect inspiration factor and pheromone inspiration factor of the algorithm at the same time, and then it improves the optimization ability of ant colony algorithm by the optimization strategy of ant colony. Meanwhile, it introduces a multiple constrained Qos routing model and uses the dynamic adaptive Max-Min ant colony algorithm for multiple constrained Qos routing model to get the best solution. In satisfying multiple Qos constrained conditions, to quickly find the communication link with the minimum cost.By a large number of simulation experiments and analysis of the experimental results, it can be seen that the proposed algorithm has faster convergence and optimization capabilities in meeting the conditions of multiple Qos constraints. And it can be more effective to solve the multiple Qos constraints problem.