Dynamic combination of improved max-min and ant colony algorithm for load balancing in cloud system

摘要

Cloud Computing is a new technology. Cloud Computing provides many facilities like on demand self-services, unlimited resources, rapid elasticity and measured services to end users. All users access these resources directly through internet. Users can use these resources and services as they want on pay per use concept. In cloud computing architecture load balancing is a very important issue. There are many algorithms for load balancing in cloud computing. All algorithms work different ways. We proposed a Improved Max-Min Ant colony Algorithm. Improved Max-Min used the concept of original Max-Min. Improved Max-Min is based on the execution time not on completion time as a selection basis. The main motive of our work is to balance the total load of cloud system .We try to minimizing the total makespan. We simulated results using the CloudSim toolkit. Results show the comparison between improved max min and new hybrid improved Max-Min ant approach. It mainly focuses on total processing time and processing cost.