Comparative Study of Load Balancing Algorithms

Abstract

In today's world, more or less every activity belong to internet. The increase of E-Commerce has leads many business activity to carry out most of their day to day business online transaction on data such as financial transaction, database access, corporate internet and other key function must run 24 hours a day ,seven days a week and network need to ability to scale the performance to handle the large volume of client request without creating unwanted delays. For availability and scalability, performances boosting more and more servers are required. Load balancing is a key issue in these type of large scale situation. Load balancing is to achieve optimal resources, maximize throughput, minimize response time and avoid the overload. Load balancing ensures that all the processor in the system or every node in the network does approximately the equal amount of work at any instant of time. The objective of this paper firstly, to compare the static load balancing and dynamic load balancing algorithm by parameter performance and secondly, to compare the dispatcher based algorithms through a simulation to evaluate their performance under different conditions and workloads