Abstract
Based on our survey of recent articles, there is little research being conducted into quantitative analysis of the load balancing of Web server clusters. In this paper, we propose a quantitative analysis for DNS-based server clusters. We also propose a two-pass load-balancing method for determining the load balance area of these clusters. The first pass uses the lookup table instead of a complicated computation for obtaining the load balancing of the Web service requests. The second pass also utilizes a lookup table by a precomputed Hessian matrix to obtain the load balancing. In addition, we compare the relative performance of dispatcher-based and DNS-based server clusters using queuing theory, analysis, and simulation, and we compare the measurement results using benchmarks. To increase the simulation performance we have designed a simulation module to promptly locate the load balancing, with a potential improvement of 36.58% over the average system response time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computers and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
