Abstract
Identifying the optimum load balancing algorithm for a web site is a difficult and complex task. This paper examines a number of simulated algorithms based on a master/slave architecture. Three algorithms are used in order to have comparable results to discuss. The first algorithm is the use of a master/slave architecture and processing requests to the relevant servers as a batch of requests. The second algorithm investigated is the standard round robin algorithm used in a master/slave architecture. The final algorithm proposed in the paper is the use of a master/slave architecture that uses the round robin algorithm combined with a reverse proxy of requests. The use of this final combination of algorithms has showed a performance improvement of 19% over conventional master/slave round robin load balancing. The use of batch processing of request shows some interesting findings useful for very heavily loaded web sites with a constant high umber of requests.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, M., Chakrabarti, S., Mitzenmachner, M., Rasmussen, L.: Parallel Randomized Load Balancing. In: Proceedings of the 27th Symposium on Theory of Computing, May29-June 1, pp. 238–247. ACM Press, New York (1995)
Chankhunthod, Danzig, P., Neerdaels, C., Schwartz, M., Worrell, K.: A Hierarchical Internet Object Cache, Technical Report 95-611, Computer Science Department, University of Southern California, Los Angeles, California (1995)
Fox, A., Gribble, S.D., Chawathe, Y., Brewer, E.A.: P Gauthier. Cluster-based scalable network services. In: Proceedings of the Sixteenth ACM Symposium on Operating System principles (October 1997)
Cao, P., Irani, S.: Cost-Aware WWW Proxy Caching Algorithms. In: Proc of the USENIX Symposium on Internet Technologies and Systems, pp. 193–206 (1997)
Zhu, H., Smith, B., Yang, T.: A Scheduling Framework for Web Server Clusters with Intensive Dynamic Content Processing. Technical Report TRCS-98-29, CS Dept, UCSB (November 1998), http://www.cs.ucsb.edu/research/rcgi
Holmedahl, V., Smith, B., Yang, T.: Cooperative Caching of Dynamic Content on a Distributed Web Server. In: Proceedings of Seventh IEEE International Symposium on High performance Distributed Computing, pp. 243–250 (1998)
Zhu, H., Smith, B., Yang, T.: Scheduling Optimization for Resource-Intensive Web Requests on Server Clusters. In: Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures (1999)
Corradi, A., Leonardi, L., Zambonelli, F.: Diffusive Load Balancing Policies for Dynamic Applications. IEEE Concurrency 7(1), 22–31 (1999), http://polaris.ing.unimo.it/Zambonelli/PDF/Concurrency.pdf
Berenbrink, P., Friedetsky, T., Steger, A.: Randomized and Adversarial Load Balancing. In: Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures (1999)
Realsystem Proxy 8 overview. RealSystem iQ Whitepaper, RealNetworks (2000), http://www.realnetworks.com/realsystems/
Kunal Dua, PC Quest, Balance your Web Servers Load (2001), http://www.pcquest.com/content/technology/101071402.asp
Anshelevich, E., Kempe, D., Kleinberg, J.: Stability of Load Balancing Algorithms in Dynamic Adversarial Systems. In: Proceedings of the thirty-fourth annual ACM symposium on Theory of computing (2002)
Nua Internet (2002), http://www.nua.net/surveys/how_many_online/index.html
Korth, J.-C.: Diffusive Load Balancing. Advanced Seminar Load Balancing for Massive Parallel Systems. Department for Simulation of Large Systems. University of Stuttgart (2003)
Sullivan, D.: Searches Per Day (2003), Searchenginewatch.com, http://www.searchenginewatch.com/reports/article.php/2156461
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O’Loughlin, F., Chambers, D. (2004). The Measurement of an Optimum Load Balancing Algorithm in a Master/Slave Architecture. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24709-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24709-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22056-5
Online ISBN: 978-3-540-24709-8
eBook Packages: Springer Book Archive