International Journal of Electrical and Computer Engineering (IJECE) Vol. 9, No. 3, June 2019, pp. 2083~2093 ISSN: 2088-8708, DOI: 10.11591/ijece.v9i3.pp2083-2093  2083 Journal homepage: http://iaescore.com/journals/index.php/IJECE AWSQ: an approximated web server queuing algorithm for heterogeneous web server cluster Kadiyala Ramana 1 , M. Ponnavaikko 2 1 Department of Computer Science and Engineering, SRMIST, India 2 Vinayaka Missions University, India Article Info ABSTRACT Article history: Received Jun 13, 2018 Revised Nov 29, 2018 Accepted Dec 24, 2018 With the rising popularity of web-based applications, the primary and consistent resource in the infrastructure of World Wide Web are cluster- based web servers. Overtly in dynamic contents and database driven applications, especially at heavy load circumstances, the performance handling of clusters is a solemn task. Without using efficient mechanisms, an overloaded web server cannot provide great performance. In clusters, this overloaded condition can be avoided using load balancing mechanisms by sharing the load among available web servers. The existing load balancing mechanisms which were intended to handle static contents will grieve from substantial performance deprivation under database-driven and dynamic contents. The most serviceable load balancing approaches are Web Server Queuing (WSQ), Server Content based Queue (QSC) and Remaining Capacity (RC) under specific conditions to provide better results. By Considering this, we have proposed an approximated web server Queuing mechanism for web server clusters and also proposed an analytical model for calculating the load of a web server. The requests are classified based on the service time and keep tracking the number of outstanding requests at each webserver to achieve better performance. The approximated load of each web server is used for load balancing. The investigational results illustrate the effectiveness of the proposed mechanism by improving the mean response time, throughput and drop rate of the server cluster. Keywords: Approximated load Load balancing Response time Throughput Web server clutser Copyright © 2019 Institute of Advanced Engineering and Science. All rights reserved. Corresponding Author: Kadiyala Ramana, Department of Computer Science and Engineering, SRM Institute of Science and Technology, Potheri, Mahatma Gandhi Rd, SRM Nagar, Kattankulathur, Tamil Nadu 603203, India. Email: ramana.it01@gmail.com 1. INTRODUCTION The volume of the information available online and services available for the internet users increased through the blast of the world wide web. The thriving of various service demands and information has made a sensational burden on the World Wide Web (WWW) infrastructure. To serve a large number of client request they need advanced web server systems. Users can expect less response time and low site downtime. To attract new customers and not to lose the current market web service providers must provide their applications with greater performance. Due to scalability, availability and cost-effectiveness of distributed web server cluster architectures, they became more popular instead of using one web server, which has high processing capabilities. In 1995, the number of internet users was less than 1% in the world population, whereas today it is 40%. In 2016, there were 3.5 billion internet users while in 2005 there were 1.02 billion internet users [1]. With the fast evolution of internet traffic, maximum popular websites need to scale up their server volumes. The popular way to provide a list of alternative, or equivalent mirrored servers at different locations.