CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Ant Colony Optimization Technique Applied in Network Routing Problem

by Debasmita Mukherjee, Sriyankar Acharyya
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 15
Year of Publication: 2010
Authors: Debasmita Mukherjee, Sriyankar Acharyya
10.5120/319-487

Debasmita Mukherjee, Sriyankar Acharyya . Ant Colony Optimization Technique Applied in Network Routing Problem. International Journal of Computer Applications. 1, 15 ( February 2010), 66-73. DOI=10.5120/319-487

@article{ 10.5120/319-487,
author = { Debasmita Mukherjee, Sriyankar Acharyya },
title = { Ant Colony Optimization Technique Applied in Network Routing Problem },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 15 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 66-73 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number15/319-487/ },
doi = { 10.5120/319-487 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:42:30.197216+05:30
%A Debasmita Mukherjee
%A Sriyankar Acharyya
%T Ant Colony Optimization Technique Applied in Network Routing Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 15
%P 66-73
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
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.

References
  1. M. Dorigo, V. Maniezzo & A. Colorni, 1996. "Ant System: Optimization by a Colony of Cooperating Agents", IEEE Transactions on Systems, Man, and Cybernetics–Part B, 26 (1): 29–41.
  2. Beckers R., Deneubourg J.L. and S. Goss (1992). Trails and U-turns in the selection of the shortest path by the ant Lasius niger. Journal of theoretical biology, 159, 397-415.
  3. AntNet:ACO routing algorithm in practice: Vincent Verstraete, Matthias Strobbe, Erik Van
  4. M.Dorigo & T.Stiitzle, Ant Colony Optimization, MIT Press, 2004.
  5. Mcgraw-Hill’s Advanced Topics in Computer Science Series, New Ideas in Optimization.
  6. Ant algorithms for discrete optimization. Source, Artificial Life archive. Volume 5 , Issue 2 (April 1999).
  7. An adaptive multi-agent routing algorithm inspired by ants behavior. Gianni Di Caro and Marco Dorigo. IRIDIA – Université Libre de Bruxelles – Belgium.
  8. Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks. Source, Lecture Notes In Computer Science
  9. The main characteristics of this model are positive feedback, ... 76, Positive feedback as a search strategy – Dorigo, Colorni – 1991
  10. Tabu Search—Part II. FRED GLOVER US WEST Chair in Systems Science, Center for Applied Artificial Intelligence.
  11. M. Dorigo, Optimization, Learning and Natural Algorithms, PhD thesis, Politecnico di Milano, Italie, 1992. S. Goss, S. Aron, J.-L. Deneubourg.
  12. Brian Hill, “The Complete Reference, CISCO”, TATA MCGRAW-Hill publishing Ltd., N.Delhi.
  13. Evolutionary Algorithms 3 Selection-The simplest selection scheme-roulette-wheel selection.
Index Terms

Computer Science
Information Sciences

Keywords

Ant Colony Optimization Routing Throughput Delay factor Pheromone

Powered by PhDFocusTM