Load Banlance For Clound Computing Based On Ant Colony Algorithm

As we know, cloud computing acts as a new business model, is changing the traditional model of network, and the way people use the Internet and computer. Cloud computing put the storage resources services, computing resources services and software services together, separate the resources from management and use, serve people with a totally new way. But because of the scale of cloud computing environment is too huge to manage, and the computing resources of different structure are incompatible, cloud computing is easy to be impated by the load imbalance.Ant colony algorithm(ACA)has emerged recently as a new meta-heuristic for complicated problems in combinatorial optimization.Inspired by the collective behavior of real ants, Dorigo, Maniezzo et al first advanced an ant colony system and the ant colony optimization algorithm(ACO)to solve several discrete optimization problems. ACA whose main characteristics are positive feedback,distributed computation and constructive greedy heuristic can apply to many NP-complete combination optimization problems successfully. ACA has exhibited its excellent performance and efficiency in experiments for solving a great lot of combinatorial optimization problems.In order to solve the problem of cloud computing load imbalance, we want to change the ACA to an ant colony optimization scheduling strategy, which is more suitable to the cloud computing resources scheduling.Firstly, a description of cloud computing and arithmetic of load balancing in cloud computing are given. Then, the outline of ACA is shown and its mechanism, feature and performances are given. After that, base on the characteristics of ACA and scheduling of cloud computing resource, this thesis set up a load banlancing scheduling model, analyzes, designs and realizes the ACA for cloud computing resource scheduling. Finally, design a contrast experiment and the results show that the algorithm has a certain extent effectiveness.