ETRI Journal

  • 제31권2호
  • /
  • Pages.173-181
  • /
  • 2009
  • /
  • 1225-6463(pISSN)
  • /
  • 2233-7326(eISSN)
한국전자통신연구원 (Electronics and Telecommunications Research Institute)
권호 표지

Estimation-Based Load-Balancing with Admission Control for Cluster Web Servers

  • Sharifian, Saeed (Department of Electrical Engineering, Amirkabir University of Technology) ;
  • Motamedi, Seyed Ahmad (Department of Electrical Engineering, Amirkabir University of Technology) ;
  • Akbari, Mohammad Kazem (Department of Computer Engineering & IT, Amirkabir University of Technology)
  • 투고 : 2008.03.13
  • 심사 : 2009.02.18
  • 발행 : 2009.04.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The growth of the World Wide Web and web-based applications is creating demand for high performance web servers to offer better throughput and shorter user-perceived latency. This demand leads to widely used cluster-based web servers in the Internet infrastructure. Load balancing algorithms play an important role in boosting the performance of cluster web servers. Previous load balancing algorithms suffer a significant performance drop under dynamic and database-driven workloads. We propose an estimation-based load balancing algorithm with admission control for cluster-based web servers. Because it is difficult to accurately determine the load of web servers, we propose an approximate policy. The algorithm classifies requests based on their service times and tracks the number of outstanding requests from each class in each web server node to dynamically estimate each web server load state. The available capacity of each web server is then computed and used for the load balancing and admission control decisions. The implementation results confirm that the proposed scheme improves both the mean response time and the throughput of clusters compared to rival load balancing algorithms and prevents clusters being overloaded even when request rates are beyond the cluster capacity.

키워드

참고문헌

  1. M. Andreolini and E. Casalicchio, “A Cluster-Based Web System Providing Differentiated and Guaranteed Services,” Cluster Computing, vol. 7, 2004, pp. 7-19.
  2. T. Schroeder, S. Goddard, and B. Ramamurthy, “Scalable Web Server Clustering Technologies,” IEEE Network, vol. 14, no. 3, May/June 2000, pp. 38-45. https://doi.org/10.1109/65.844499
  3. J. Challenger et al., “Efficiently Serving Dynamic Data at Highly Accessed Web Sites,” IEEE/ACM Trans. on Networking, vol. 12, 2004, pp. 223-233.
  4. M. Andreolini, M. Colajanni, and R. Morselli, “Performance Study of Dispatching Algorithms in Multi-tier Web Architectures,” ACM SIGMETRICS Perf. Eval. Review, vol. 30, no. 2, Sept. 2002, pp. 10-20. https://doi.org/10.1145/588160.588163
  5. V. Cardellini et al., “The State of the Art in Locally Distributed Web-Server Systems,” ACM Computing Surveys (CSUR), vol. 31, June 2002, pp. 263-311.
  6. E. Casalicchio and S. Tucci, “Static and Dynamic Scheduling Algorithms for Scalable Web Server Farm,” Proc. Euromicro Workshop on Parallel and Dist. Proc., 2001, pp. 199-176.
  7. E. Casalicchio, V. Cardellini, and M. Colajanni, “Client-Aware Dispatching Algorithms for Cluster-Based Web Servers,” Cluster Comp., vol. 5, no. 1, Jan. 2002, pp. 65-74. https://doi.org/10.1023/A:1012796706047
  8. M. Andreolini, M. Colajanni, and M. Nuccio, “Scalability of Content-Aware Server Switches for Cluster-Based Web Information Systems,” Proc. IEEE World Wide Web Conf., 2003.
  9. Q. Zhang et al., “Workload-Aware Load Balancing for Clustered Web Servers,” IEEE Trans. Parallel and Distributed Systems, vol. 16, Mar. 2005, pp. 219-233. https://doi.org/10.1109/TPDS.2005.38
  10. H.K. Lee, “A PROactive Request Distribution (PRORD) Using Web Log Mining in a Cluster-Based Web Server,” International Conference on Parallel Processing (ICPP), 2006, pp. 559-568.
  11. A. Chandra et al., “An Observation-Based Approach Towards Self-Managing Web Servers,” Computer Communications, vol. 29, May 2006, pp. 1174-1188. https://doi.org/10.1016/j.comcom.2005.07.003
  12. L. Chen, Y. Lu, and T.F. Abdelzaher, “Feedback Control Architecture and Design Methodology for Service Delay Guarantees in Web Servers,” IEEE Parallel and Distributed Systems, vol. 17, 2006, pp. 1014-1027. https://doi.org/10.1109/TPDS.2006.123
  13. V. Cardellini et al., “Web Switch Support for Differentiated Services,” ACM SIGMETRICS Performance Evaluation Review, vol. 29, Sept. 2001, pp. 14-19. https://doi.org/10.1145/572317.572320
  14. Z. Xiong and P. Yan, “A Solution for Supporting QoS in Web Server Cluster,” Proc. of International Conference on Wireless Communications, Networking and Mobile Computing, vol. 2, no. 23-26, Sept. 2005, pp. 834-839.
  15. V. Cardellini et al., “Mechanisms for Quality of Service in Web Clusters,” Computer Networks, vol. 17, Dec. 2001, pp. 761-771.
  16. V. Cardellini, M. Colajanni, and P. Yu, “Request Redirection Algorithms for Distributed Web Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 4, April 2003, pp. 355-368. https://doi.org/10.1109/TPDS.2003.1195408
  17. M. Mitzenmacher, “How Useful is Old Information,” IEEE Trans. Parallel and Distributed Systems, vol. 11, Jan. 2000, pp. 6-20. https://doi.org/10.1109/71.824633
  18. M. Dahlin, “Interpreting Stale Load Information,” IEEE Trans. Parallel Distributed System, vol. 11, no. 10, Oct. 2000, pp. 1033-1047. https://doi.org/10.1109/71.888643
  19. B. Schroeder and M.H. Balter, “Web Servers under Overload: How Scheduling Can Help,” ACM Trans. Internet Technology (TOIT), vol. 6, no. 1, Feb. 2006, pp. 20-52. https://doi.org/10.1145/1125274.1125276
  20. A. Cockcroft and B. Walker, Capacity Planning for Internet Services, SUN Press, 2001.
  21. Webstone: http://www.mindcraft.com/webstone.
  22. Specweb99: http://www.spec.org.
  23. RUBIS benchmark: http://rubis.objectweb.org/
  24. RUBIS benchmark: http://rubis.objectweb.org/
  25. Apache: http://www.apache.org.
  26. MySQL Database: http://www.mysql.com/.
  27. D. Mosberger and T. Jin, “Httperf: A Tool to Measure Web Server Performance,” Proc. USENIX Symp. Internet Technologies and Systems, 1997, pp. 59-76.