WSQ: Web Server Queueing Algorithm for Dynamic Load Balancing

Web server performance is the most critical issue for web users. Number of users degrades the performance of the web servers. An overloaded web server cannot provide better performance without any efficient mechanism. To reduce this overloaded condition, several load balancing algorithms divide the load into other web servers present in a cluster. Remaining capacity (RC) and server content based queue (QSC) load balancing algorithms are most usable load balancing algorithms, but it provides better results in some specific conditions. An efficient load balancing algorithm can be designed based on load balancing factors of the web servers such as memory length, queue-length and number of active connections which affects the web server’s performance. The utilization of the web servers and drop rate of the requests has been measured also to remove the overloaded condition of the web servers. Further, two existing algorithms (RC and QSC) have been simulated and the results have been compared with WSQ-proposed load balancing algorithm. The results of simulation of the proposed algorithm minimizes the drop rates in homogeneous as well as heterogeneous environments and the mean response time is also minimized, but lowest percentage of server utilization has achieved in comparison to existing algorithms. Therefore, the proposed algorithm has shown the best performance in high traffic case of web servers.