ACES: An efficient admission control scheme for QoS-aware web servers

Abstract

The unpredictability of server response performance hinders the advance of new application on the Internet. In this paper, we present an efficient admission control algorithm, ACES, based on the server workload characteristics. The admission control algorithm ensures the bounded response time from a web server by periodical allocation of system resources according to the resource requirements of incoming tasks. By rejecting requests exceeding server capacity, the response performance of the server is well maintained even under high system utilization. The resource requirements of tasks are estimated based on their types. A double-queue structure is implemented to reduce the effects caused by estimation inaccuracy, and to exploit the spare capacity of the server, thus increasing the system throughput. The admission control algorithm can be used for server overload control and for QoS provisioning of service differentiating Internet servers. Response delays of accepted tasks are bounded by the desired predefined time period. Theoretical analyses and experimental studies show that the ACES algorithm provides desirable throughput and bounded response delay to the tasks, without any significant impact on the aggregate throughput performance of the system under various workload situations.