A Novel Load Balancing Algorithm Based on Improved Particle Swarm Optimization in Cloud Computing Environment

Abstract

In the area of cloud computing load balancing, the Particle Swarm Optimization (PSO) algorithm is neoteric and now praised highly, but recently a more neoteric algorithm which deploys the classifier into load balancing is presented. Besides, an algorithm called red-black tree which is aiming at improving the efficiency of resource dispatching is also praised. But the 3 algorithms all have different disadvantages which cannot be ignored. For example, the dispatch efficiency of PSO algorithm is not satisfying; although classifier and red-black tree algorithm improve the efficiency of dispatching tasks, the performance in load balancing is not that good, as a result the improved PSO algorithm is presented. Some researches are designed to get the advantages of new algorithm. First of all, the time complexity and performance for each algorithm in theory are computed; and then actual data which are generated in experiments are given to demonstrate the performance. And from the experiment result, it can be found that for the speed of algorithm itself PSO is the lowest, and the improved PSO solve this problem in some degree; improved PSO algorithm has the best performance in task solving and PSO is the second one, the red-black and Naive Bayes algorithm are much slower; PSO and improved PSO algorithm perform well in load balancing, while the other two algorithms do not do well.