CFP last date
20 December 2024
Reseach Article

Load Balancing in Network to Increasing Performance Ratio of Packet Delivery using Ant Colony Optimization

by Niitn Girme
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 110 - Number 13
Year of Publication: 2015
Authors: Niitn Girme
10.5120/19376-1030

Niitn Girme . Load Balancing in Network to Increasing Performance Ratio of Packet Delivery using Ant Colony Optimization. International Journal of Computer Applications. 110, 13 ( January 2015), 16-20. DOI=10.5120/19376-1030

@article{ 10.5120/19376-1030,
author = { Niitn Girme },
title = { Load Balancing in Network to Increasing Performance Ratio of Packet Delivery using Ant Colony Optimization },
journal = { International Journal of Computer Applications },
issue_date = { January 2015 },
volume = { 110 },
number = { 13 },
month = { January },
year = { 2015 },
issn = { 0975-8887 },
pages = { 16-20 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume110/number13/19376-1030/ },
doi = { 10.5120/19376-1030 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:46:15.897288+05:30
%A Niitn Girme
%T Load Balancing in Network to Increasing Performance Ratio of Packet Delivery using Ant Colony Optimization
%J International Journal of Computer Applications
%@ 0975-8887
%V 110
%N 13
%P 16-20
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Now a day's networks grow to become more and more complicated. Network can be wireless or wired with number of nodes. The problem remains the same in order to get best performance of packet delivery. There is need to find shortest path in order accomplish the delivery of packet. It's very difficult task to manage the load balance in between traffic and routing packets to the destination. Those nodes carrying excess data can become congested in network and chance to data lost. The nature gives the solution to managing the load balancing in between network to handle largest influx of traffic. The ants goes outside for finding their foods and come to their nest. The ants move across the network in between randomly chosen pairs of nodes; as they move they deposit simulated pheromones as a function of their distance from their own source node, and the congestion encountered on their root. They select their path at each intermediate node according the distribution of simulated pheromones at each node. For each intermediate node the calls come from source to reach destination as a function of pheromone distributation at each intermediate node. The performance of the network is measured by load balancing in network, performance ratio, and packet loss ratio as compared to open shortest path first algorithm.

References
  1. B. Barán, M Almirón, E. Chaparro. 'Ant Distributed System for Solving the Traveling Salesman Problem'. pp. 779-789. Vol. 215 th Informatic Latinoamerican Conference-CLEI,. Paraguay (1999).
  2. B. Barán, M Almirón, E. Chaparro. 'Ant Distributed System for Solving the Traveling Salesman Problem'. pp. 779-789. Vol. 215 th Informatic Latinoamerican Conference-CLEI,. Paraguay (1999).
  3. M. Dorigo, V. Maniezzo, A. Colorni. 'The Ant System: Optimization by a colony of cooperating agents'. pp. 1-13. Vol. 26-Part B. IEEE Transactions on Systems, Man, and Cybernetics,. Number 1 (1996).
  4. M. Dorigo, G. Di Caro. 'AntNet. Distributed Stigmergetic Control for Communications Networks'. pp. 317-365 Journal of Artificial Intelligence Research. Number 9 (1998).
  5. [Schoonderwoerd et al 97] R. Schoonderwoerd, O. Holland, J. Bruten. 'Ant-like agents for load balancing in telecommunications networks'. Hewlett-Packard Laboratories, Bristol-England (1997).
  6. Beckers, R. , Holland, O. E. , & Deneubourg, J. L. (1994). From local actions to global tasks: Stigmergy and Collective Robotics. In R. A. Brooks, & P. Maes (Eds. ) Artificial Life IV, Cambridge, MIT Press. p. 181-189.
  7. Beckers, R. , Deneubourg, J. L. , & Goss, S. (1992). Trails and U-turns in the Selection of a Path by the Ant Lasius Niger. In J. theor. Biol. 159, 397-415.
  8. Stickland, T. R. , Tofts, C. M. N. , & Franks, N. R. (1992). A path choice algorithm for ants. In Naturwissenschaften 79, 567-572.
  9. Goss. S. , Beckers, R. , Deneubourg, J. L. , Aron, S. , & Pasteels, J. M. (1990). How trail-laying and trail following can solve foraging problems for ant colonies. In R. N. Hughes (Ed. ) NATO AS1 Series, Vol. G20 Behavioral mechanisms of food selection, Springer Verlag.
  10. Deneubourg, J. L. , Goss, S. , Franks, N. , Sendova-Franks, A. , Detrain C. , & Chrétien, L. (1990). The dynamics of collective sorting robot-like ants and ant-like robots. In J. -A. Meyer & S. Wilson (Eds. ), From Animals to Animats: Proceedings of the first international conference on simulation of adaptive behavior. Cambridge,MITPress.
  11. Beckers, Deneubourg & Goss, 1992; Deneubourg & Goss, 1989; Goss et. al. , 1990; Franks, 1989.
  12. Beckers, Holland & Deneubourg, 1994; Russell 1995; Deveza et. al. , 1994.
  13. A. Shankar, C. Alaettinoglu, I. Matta. 'Performance Comparison of Routing Protocols using MaRS. Distance Vector versus Link-State'. Technical Report, Maryland-USA (1992)
  14. Modeling the collective building of complex architectures in social insects with lattice swarms, Theraulaz and Bonabeau, Journal of Theoretical Biology, 1995.
  15. Bert Hölldobler, E. O. Wilson: "Journey to the Ants: A Story of Scientific Exploration, 1994, ISBN 0-674-48525-4.
  16. http://ethesis. nitrkl. ac. in/1128/1/thesis. pdf
  17. Grid Load Balancing Using Ant Colony Optimization Nasir, H. J. A. ; Ku-Mahamud, K. R. Computer and Network Technology (ICCNT), 2010 Second International Conference onDigital Object Identifier: 10. 1109/ICCNT. 2010. 10 Publication Year: 2010 , Page(s): 207 – 211
  18. Load Balancing of Nodes in Cloud Using Ant Colony Optimization Nishant, K. ; Sharma, P. ; Krishna, V. ; Gupta, C. ; Singh, K. P. ; Nitin, N. ; Rastogi, R. Computer Modelling and Simulation (UKSim), 2012 UKSim 14th International Conference on Digital Object Identifier: 10. 1109/UKSim. 2012. 11
  19. Load Balancing in Non-dedicated Grids Using Ant Colony Optimization Yixiong Chen Semantics, Knowledge and Grid, 2008. SKG '08. Fourth International Conference onDigital Object Identifier: 10. 1109/SKG. 2008. 41
  20. A Survey of Ant Colony Optimization-Based Approaches to Routing in Computer Networks Janacik, P. ; Orfanus, D. ; Wilke, A. Intelligent Systems Modelling & Simulation (ISMS), 2013 4th International Conference on Digital Object Identifier: 10. 1109/ISMS. 2013. 20 Publication Year: 2013 , Page(s): 427 – 432
  21. Multiple Ant Colony Routing Optimization Based on Cloud Model for WSN with Long-Chain Structure Yongli Zhu ; Junyan Zhang ; Lifen Li ; Wei Peng Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on Digital Object Identifier: 10. 1109/WICOM. 2010. 5601101Publication Year: 2010 , Page(s): 1 - 4
  22. http://en. wikipedia. org/wiki/Ant_colony_optimization_algorithms
  23. http://www. ijarcsse. com/docs/papers/Volume_4/6_June2014/V4I6-0186. pdf
  24. ftp://labattmot. ele. ita. br/ele/jrsantos/Leitura/ACO/ANT-rapport. pdf
  25. http://ethesis. nitrkl. ac. in/1321/1/project. pdf
  26. http://research. ijcaonline. org/volume39/number5/pxc3877068. pdf
  27. http://enggjournals. com/ijcse/doc/IJCSE10-02-02-05. pdf
Index Terms

Computer Science
Information Sciences

Keywords

Influx of traffic pheromone table