Title of article
Ant Colony Optimization Technique Applied in Network Routing Problem
Author/Authors
Debasmita Mukherjee، نويسنده , , Sriyankar Acharyya، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
66
To page
73
Abstract
In this paper, the Ant Colony Optimization Technique has been applied in different network models with different number of nodes and structure to find the shortest path with optimum throughput. Three variations of the Ant Colony Optimization Technique, ACO1, ACO2 and ACO3 has been proposed and applied on different standard network models and the results has been analyzed and concluded. A Tabu list is also maintained for a network with large number of nodes and results were collected to find the optimum size of the Tabu list in one of the algorithms proposed here. Experiments have also been performed by varying the load of the network. Here the throughput and the reliability of the network has been specially taken as the performance factor of the network.
Keywords
ant colony , routing , throughput , Tabu list , Delay factor , pheromone , optimization
Journal title
International Journal of Computer Applications
Serial Year
2010
Journal title
International Journal of Computer Applications
Record number
659487
Link To Document