Comparative Analysis of Load Balancing Algorithms in Cloud Computing

Cloud computing, now a days is becoming the most demanding and evolving technology all over the world as cloud computing emphases on increasing the effectiveness of the shared resources as well as cloud resources are generally not only shared by numerous users but as dynamically re-allocated per demand. The use of network services are increased by cloud computing which is an internet based computer technology. The main difficulty associated to cloud computing is the load balancing. The load can be characterized as a memory, CPU storage capacity, a network or delay load. It is always required to segments work load among the dissimilar nodes of the distributed system to advance the resource consumption and for enhanced performance of the system. This can support to evade the condition where nodes in the network are heavily loaded or under loaded. Cloud load balancing helps to enhance the overall cloud performance. This paper emphasize on a new hybrid approach and its comparison with various existing load balancing algorithms such as round robin, throttled, escel, and pso on the basis of overall response time, execution time as well as on the data centre request servicing time.