The Research on QoS Routing Algorithm Based on Improved Optimization Sorting Ant Colony Algorithm

In ordering to resolve the slow convergence problem of ant colony algorithm in QoS routing, this paper presents a sort of ant colony algorithm which based on optimized sequence. In global pheromone updating, this algorithm weakens the influence of a single iteration solution and adopt a combination of the optimal solution within the scope of the iteration, which could make ant still choose the best path toward a particular direction when a poor solution occurs. At last, the simulation experiments proves that convergence rate of this improved ant colony algorithm works significantly faster, and stability has been greatly improved.