ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 26, Issue 14, 1 September 2003, Pages 1581-1593
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (468 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0140-3664(02)00259-1    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2002 Elsevier B.V. All rights reserved.

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

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Xiangping Chen, Huamin ChenE-mail The Corresponding Author and Prasant MohapatraCorresponding Author Contact Information, E-mail The Corresponding Author

2063 Engineering II, Department of Computer Science, University of California, One Sheilds Ave., Davis, CA 95616, USA


Received 22 May 2002; 
revised 9 October 2002; 
accepted 31 October 2002. ;
Available online 4 February 2003.

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.

Author Keywords: Admission control; Bounded response time; Internet; Admission control based on estimation of service time; QoS; Service differentiating Internet servers

Article Outline

1. Introduction
2. Background
3. The ACES algorithm and overload control
3.1. Delay bound assurance
3.2. Service time estimation
3.3. The double queue structure
4. Service differentiation
4.1. Estimation of request rate
4.2. Delay bounds of prioritized tasks
4.3. Waiting time estimation
5. Performance evaluation
5.1. Overload management performance
5.1.1. Throughput comparison
5.1.2. Average delay
5.1.3. Delay bound miss probability
5.2. The ACES algorithm is SDIS
5.2.1. Throughput performance
5.2.2. Delay performance
5.2.3. Sensitivity test
6. Related works
7. Conclusion
Acknowledgements
References















Corresponding Author Contact InformationCorresponding author. Tel.: +1-530-7548380; fax: +1-530-7524767


Computer Communications
Volume 26, Issue 14, 1 September 2003, Pages 1581-1593
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.