Distributed dynamic routing using ant algorithm for telecommunication networks

In telecommunication networks, routing is an important issue. For this reason, we study a distributed dynamic routing (DDR) approach, and propose a novel distributed real-time dynamic routing (DRDR) approach which considers not only the utilization of resources but also the load balance in telecommunication networks. In the approach, according to the concrete problems of dynamic routing, we construct a globally-optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source when looking for food, to realize the route optimization. Simulation results show that the proposed approach can realize distributed dynamic routing effectively according to the current traffic states in the networks and the user-specified delay requirements