QoSR Algorithm of Q-ACO Based on Convergence Grads Expectation

Although we can get the optimal path of network by ACO, there are too many interative times and the convergence speed is too slow. This paper proposes the Q-ACO QoSR based on convergence expectation with the real-time and the high efficiency of network. The algorithm defines index expectation function of link and proposes convergence expectation and convergence grads. This method improves the ability of routing and convergence speed. It can get the optimal path at a high efficiency by comparing the convergence grads quickly.