The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Performance guarantees for Web server end-systems: a control-theoretical approach
Abstract
The Internet is undergoing substantial changes from a communication and browsing infrastructure to a medium for conducting business and marketing a myriad of services. The World Wide Web provides a uniform and widely-accepted application interface used by these services to reach multitudes of clients. These changes place the Web server at the center of a gradually emerging e-service infrastructure with increasing requirements for service quality and reliability guarantees in an unpredictable and highly-dynamic environment. This paper describes performance control of a Web server using classical feedback control theory. We use feedback control theory to achieve overload protection, performance guarantees, and service differentiation in the presence of load unpredictability. We show that feedback control theory offers a promising analytic foundation for providing service differentiation and performance guarantees. We demonstrate how a general Web server may be modeled for purposes of performance control, present the equivalents of sensors and actuators, formulate a simple feedback loop, describe how it can leverage on real-time scheduling and feedback-control theories to achieve per-class response-time and throughput guarantees, and evaluate the efficacy of the scheme on an experimental testbed using the most popular Web server, Apache. Experimental results indicate that control-theoretic techniques offer a sound way of achieving desired performance in performance-critical Internet applications. Our QoS (Quality-of-Service) management solutions can be implemented either in middleware that is transparent to the server, or as a library called by server code.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433
Cited by
Managing energy and server resources in hosting centers
Chase, J. S., Anderson, D. C., Thakar, P. N., Vahdat, A. M., & Doyle, R. P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502045 · Cited by 1,284
Real Time Scheduling Theory: A Historical Perspective
Sha, L., Abdelzaher, T., årzén, K.-E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., & Mok, A. K. (2004) · Real-Time Systems · doi:10.1023/b:time.0000045315.61234.1e · Cited by 614
Self-citationControl Theory for Model-based Performance-driven Software Adaptation
Arcelli, D., Cortellessa, V., Filieri, A., & Leva, A. (2015) · Proceedings of the 11th International ACM SIGSOFT Conference on Quality of Software Architectures · doi:10.1145/2737182.2737187 · Cited by 23
Prabhakaran, G., & Selvakumar, S. (2021) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-021-03013-2 · Cited by 4
Metadata
- Authors
- Abdelzaher, T. F., Shin, K. G., & Bhatti, N.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2002
- Volume
- 13
- Issue
- 1
- Pages
- 80-96
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2002016612
- Cited by
- 594
- References
- 1
- FWCI
- 52.30
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Performance guarantees for Web server end-systems: a control-theoretical approach. https://app.cochat.ai/papers/10.1109/71.980028
- The paper
- Abdelzaher, T. F., Shin, K. G., & Bhatti, N. (2002). Performance guarantees for Web server end-systems: a control-theoretical approach. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/71.980028
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.