Solution to the problem of ant being stuck by ant colony routing algorithm

Many ant colony routing (ACR) algorithms have been presented in recent years, but few have studied the problem that ants will get stuck with probability in any terminal host when they are searching paths to route packets around a network. The problem has to be faced when designing and implementing the ACR algorithm. This article analyzes in detail the differences between the ACR and the ant colony optimization (ACO). Besides, particular restrictions on the ACR are pointed out and the three causes of ant being-stuck problem are obtained. Furthermore, this article proposes a new ant searching mechanism through dual path-checking and online routing loop removing by every intermediate node an ant visited and the destination host respectively, to solve the problem of ant being stuck and routing loop simultaneously. The result of numerical simulation is abstracted from one real network. Compared with existing two typical ACR algorithms, it shows that the proposed algorithm can settle the problem of ant being stuck and achieve more effective searching outcome for optimization path.