Abstract Views :152 |
PDF Views:3
Authors
Affiliations
1 MIT College of Engineering, Pune, IN
Source
Networking and Communication Engineering, Vol 3, No 7 (2011), Pagination: 486-490
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.
