A MODIFIED ANT COLONY ALGORITHM BASED ON ORIENTATION FACTOR FOR MULTI-CONSTRAINT QOS ROUTING

摘要

The routing problem in high-speed multi-media network can generally be attributed to one of the multi-constraint QoS problems, which is, to a large extent, an NP-Complete problem. The solution to this problem needs an intelligent optimization. This paper proposes a modified ant colony algorithm for solving the multi-constraint QoS routing problem. Simulation results indicate that this new algorithm is better than the basic ant colony algorithm. The ant colony algorithm with orientation factor accelerates the convergence speed, enables the ant to get rid of the blindness in finding the path. The original search outcome is utilized and the misguiding function of the pheromone on the irrelevant paths is reduced as well. Thus the drawback of slow convergence speed is overcome and feasible routing can be found more quickly.