Open Access Open Access  Restricted Access Subscription or Fee Access

Ant Based Route Optimization for FTP Protocol

Suvarna Joshi, Snehal Neharkar, Poonam Baviskar, Pramila Gaidhani, Varsha Koli

Abstract


Ant colony optimization (ACO) has proved a meta-heuristic optimization in several network applications.In this this paper we are presenting proposed ACO algorithm for load balancing and route optimization in distributed system for faster file transfer. This algorithm is fully distributed in which information is dynamically updated at each ant movement .It is an alternative algorithm for well known Open Shortest Path First(OSPF)[17] protocol and standard work stealing algorithm. ACO studies the behavior of ants,real ant can always find the shortest way between the nest and food by laying pheromone in a colony and mimics this behavior in software ant which gradually constructs shortest paths .The corresponding mathematical model is found. We distributing the work in homogeneous LAN with help of that mathematical model .We constructing sole FTP client ,FTP server and AntServer which will take care of pheromone updation ,file transfer and moving load. So we are presenting the novel approach which will balance the load on network and find the optimal path on concurrent mult-ipath network. Finally in the results we are showing simulations results which depicts the difference between ACO algorithm and standard load balancing algorithm.

Keywords


Ant Colony Optimization, BANT-Backward ANT, FANT-Forward ANT, META Heuristic

Full Text:

PDF

References


A. Colorni, M. Dorigo, V. Maniezzo (1991) “Distributed optimization by ant colonies”, In Proceedings of ECAL'91 European Conference on Artificial Life, Elsevier Publishing,Amsterdam, The Netherlands, pp 134-142

Dorigo M., Gambardella L.M.”Ant Colony System: A Cooperative Learning Approach”. IEEE Trans. Evol. Comp. 1 (1997), pp. 53-66

B. Bullnheimer, R.F. Hartl, C. Strauss (1999) “A new rank-based version of the ant system: a computational study”, Central European Journal of Operations Research 7(1):25-38

M.G.C. Resende and C.C. Ribeiro, “Greedy Randomized AdaptiveSearch Procedures,” State-of-the-Art Handbook of Metaheuristics, F. Glover and G. Kochenberger, eds., Kluwer Academic Publishers, 2002.

M. Dorigo and T. Stu¨ tzle, “Ant Colony Optimization”. MIT Press, 2004.

Dorigo, M and Gambardella, L. (1997) "Ant Colonies for the Traveling Salesman Problem", Biosystems, 43, pp. 73-81.

Dorigo, M. and Di Caro, G. (1999) "The Ant Colony Optimization Metaheuristic", in New Ideas in Optimization, Corne, D., Dorigo, M. and Golver, F. (eds), McGraw-Hill, pp. 11-32

M. Dorigo (1992) “Optimization, learning and natural algorithms”, Ph.D. Thesis, Politecnicodi Milano, Milano

G. di Caro, M. Dorigo (1998) “Antnet: distributed stigmergetic control for communicationsNetworks”, Journal of Artificial Intelligence Research, 9:317-365 M. Dorigo, E. Bonabeau, and G. Theraulaz. “Ant algorithms and stigmergy”. Future Generation Computer Systems”, 16(8):851ñ871, 2000.

M. Dorigo and G. Di Caro. “Ant colony optimization: A new meta-heuristic”, In Proceedings of CEC99- Congress on Evolutionary Computation, Washington DC, July 6-9 1999.

M. Dorigo and G. Di Caro. “The ant colony optimization meta-heuristic”. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11ñ32. McGraw-Hill, 1999.

M. Dorigo, G. Di Caro, and T. St ® utzle (Editors).” Ant algorithms. Special Issue on Future Generation Computer Systems (FGCS)”, 16(8), 2000.

M. Dorigo, G. Di Caro, and L. M. Gambardella. “Ant algorithms for discrete optimization. Arti_cial Life”, 5(2):137ñ172, 1999.

T. Stutzle and H. Hoos, “The Max-Min Ant System and Local Search for Combinatorial Optimization Problems,” Meta-Heuristics:Advances and Trends in Local Search Paradigms for Optimization, S. Vosß, S. Martello, I.H. Osman, and C. Roucairol, eds., Kluwer Academic Publishers, pp. 313-329, 1999

P.B. Godfrey and I. Stoica, “Heterogeneity and Load Balance in Distributed Hash Tables,” Proc. IEEE INFOCOM, 2005.

Chyouhwa Chen and Kun-Cheng Tsai,”The Server Reassignment Problem for Load Balancing in Structured P2P Systems” IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 19, NO. 2, FEBRUARY 2008

Vincent Verstraete, Matthias Strobbe, Erik Van Breusegem,Jan Coppens, Mario Pickavet, Piet Demeester “AntNet: ACO routing algorithm in practice”, Ghent University - IBBT - IMEC, Department of Information Technology,Gaston Crommenlaan 8 bus 201, 9050 Gent, Belgium

Rajbhupinder Kaur, 2Ranjit Singh Dhillon, 3Harwinder Singh Sohal, 4Amarpreet Singh Gill “Load Balancing of Ant Based Algorithm in MANET” IJCST Vol. 1, Iss ue 2, December 2010

Gianni Di Caro, “Ant Colony Optimization and its Application to Adaptive Routing in Telecommunication Networks” Dissertation pr´esent´ee en vue de l'obtention du grade de Docteur en Sciences Appliqu´ees Bruxelles, September 2004


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.