Analysis & Minimization of the Effect of Delay on Load Balancing for Efficient Web Server Queueing Model

Abstract

Load balancing applications introduce delays due to load relocation among various web servers and depend upon the design of balancing algorithms and resources required to share in the large and wide applications. The performance of web servers depends upon the efficient sharing of the resources and it can be evaluated by the overall task completion time of the tasks based on the load balancing algorithm. Each load balancing algorithm introduces delay in the task allocation among the web servers, but still improved the performance of web servers dynamically. As a result, the queue-length of web server and average waiting time of tasks decreases with load balancing instants based on zero, deterministic, and random types of delay. In this paper, the effects of delay due to load balancing have been analyzed based on the factors: average queue-length and average waiting time of tasks. In the proposed Ratio Factor Based Delay Model (RFBDM), the above factors are minimized and improved the functioning of the web server system based on the average task completion time of each web server node. Based on the ratio of average task completion time, the average queue-length and average waiting time of the tasks allocated to the web server have been analyzed and simulated with Monte-Carlo simulation. The results of simulation have shown that the effects of delays in terms of average queue-length and average waiting time using proposed model have minimized in comparison to existing delay models of the web servers.

Analysis of Effective Load Balancing Techniques in Distributed Environment

“…The collected information is used in traffic distribution for improving the performance of web servers. Singh and Kumar [7] suggested that task completion time directly affects the queue length of the web server. They presented a model based on the ratio factor of the task's average completion time.…”

Load Balancing Approaches for Web Servers: A Survey of Recent Trends

“…A polling-based approach is analyzed in reference [31] among the methods applicable to fetching feeds, which is based on a specific schedule for visiting feeds. While the existing polling-based approaches have focused on the allocation of fetching resources to feed in order to either reduce the fetching delay or increase the number of fetched entries, for optimizing both objectives a proposal is present by Singh and Kumar [32].…”

“…Delay due to load balancing is analyzed in reference [32] based on factors such as average queue length and average waiting time of tasks. Ratio Factor Based Delay Model (RFBDM) is presented, which is an improvement of delay model presented in reference [33].…”