The Incidence of the Controllable Parameters in Routing Algorithms Based on Ant Colony Optimization

Routing algorithms are used to find routes which are helpful to establish efficient data communication in computer networks. As the size of the network grows, finding routes becomes more complex in a nonlinear way. Therefore, some innovative techniques such as Ant Colony Optimization, intended for solving these issues have been presented by several researchers. This paper presents an empirical study consisting of experiments related to the use of such algorithms applied to the routing problem, as a framework for understanding its behavior. Results shown in this paper indicate that some factors involved in the process can be fine-tuned in order to improve the performance of the algorithm.