The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
The state of the art in locally distributed Web-server systems
Open accessAbstract
The overall increase in traffic on the World Wide Web is augmenting user-perceived response times from popular Web sites, especially in conjunction with special events. System platforms that do not replicate information content cannot provide the needed scalability to handle large traffic volumes and to match rapid and dramatic changes in the number of clients. The need to improve the performance of Web-based services has produced a variety of novel content delivery architectures. This article will focus on Web system architectures that consist of multiple server nodes distributed on a local area, with one or more mechanisms to spread client requests among the nodes. After years of continual proposals of new system solutions, routing mechanisms, and policies (the first dated back to 1994 when the NCSA Web site had to face the first million of requests per day), many problems concerning multiple server architectures for Web sites have been solved. Other issues remain to be addressed, especially at the network application layer, but the main techniques and methodologies for building scalable Web content delivery architectures placed in a single location are settled now. This article classifies and describes main mechanisms to split the traffic load among the server nodes, discussing both the alternative architectures and the load sharing policies. To this purpose, it focuses on architectures, internal routing mechanisms, and dispatching request algorithms for designing and implementing scalable Web-server systems under the control of one content provider. It identifies also some of the open research issues associated with the use of distributed systems for highly accessed Web sites.
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
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650143 · Cited by 2,731
Sadagopan, S. (2002) · Ubiquity · doi:10.1145/504689.504690 · Cited by 1,377
Hypertext Transfer Protocol -- HTTP/1.1
Fielding, R., Gettys, J., Mogul, J., Frystyk, H., Masinter, L., Leach, P., & Berners-Lee, T. (1999) · doi:10.17487/rfc2616 · Cited by 1,218
A taxonomy of scheduling in general-purpose distributed computing systems
Casavant, T. L., & Kuhl, J. G. (1988) · IEEE Transactions on Software Engineering · doi:10.1109/32.4634 · Cited by 976
Proceedings of the 27th International Conference on Very Large Data Bases
Apers, P. M. G., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., & Snodgrass, R. T. (2001) · Cited by 845
A workload characterization study of the 1998 World Cup Web site
Arlitt, M., & Jin, T. (2000) · IEEE Network · doi:10.1109/65.844498 · Cited by 766
A survey of web caching schemes for the Internet
Wang, J. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505696.505701 · Cited by 682
Performance guarantees for Web server end-systems: a control-theoretical approach
Abdelzaher, T. F., Shin, K. G., & Bhatti, N. (2002) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.980028 · Cited by 594
Dynamic load balancing on Web-server systems
Cardellini, V., Colajanni, M., & Yu, P. S. (1999) · IEEE Internet Computing · doi:10.1109/4236.769420 · Cited by 559
Self-citationCluster-based scalable network services
Fox, A., Gribble, S. D., Chawathe, Y., Brewer, E. A., & Gauthier, P. (1997) · Proceedings of the sixteenth ACM symposium on Operating systems principles · doi:10.1145/268998.266662 · Cited by 522
Locality-aware request distribution in cluster-based network servers
Pai, V. S., Aron, M., Banga, G., Svendsen, M. S., Druschel, P., Willy Zwaenepoel, Y., & Nahum, E. (1998) · ACM SIGPLAN Notices · doi:10.1145/291006.291048 · Cited by 505
Load Sharing in Distributed Systems
Wang, Y.-T., & Morris (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.1676564 · Cited by 458
Traditional IP Network Address Translator (Traditional NAT)
Srisuresh, P., & Egevang, K. (2001) · doi:10.17487/rfc3022 · Cited by 434
Flash: an efficient and portable web server
Pai, V. S., Druschel, P., & Willy Zwaenepoel, Y. (1999) · Cited by 333
On Choosing a Task Assignment Policy for a Distributed Server System
Harchol-Balter, M., Crovella, M. E., & Murta, C. D. (1999) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1999.1577 · Cited by 316
Analysis of SRPT scheduling: investigating unfairness
Bansal, N., & Harchol-Balter, M. (2001) · Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/378420.378792 · Cited by 312
On the effectiveness of DNS-based server selection
Shaikh, A., Tewari, R., & Agrawal, M. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916678 · Cited by 263
Connection Scheduling in Web Servers
Crovella, M. E., Frangioso, R., & Harchol‐Balter, M. (1999) · Cited by 200
IO-Lite: a unified I/O buffering and caching system
Pai, V. S., Druschel, P., & Zwaenepoel, W. (2000) · ACM Transactions on Computer Systems · doi:10.1145/332799.332895 · Cited by 187
Internet Growth: Is There a “Moore’s Law” for Data Traffic?
Coffman, K. G., & Odlyzko, A. M. (2002) · Massive computing · doi:10.1007/978-1-4615-0005-6_3 · Cited by 173
ONE-IP: techniques for hosting a service on a cluster of machines
Damani, O. P., Chung, P. E., Huang, Y., Kintala, C. M. R., & Wang, Y. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00030-5 · Cited by 150
Network Dispatcher: a connection router for scalable Internet services
Hunt, G. D. H., Goldszmidt, G. S., King, R. P., & Mukherjee, R. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00088-9 · Cited by 144
Enabling dynamic content caching for database-driven web sites
Candan, K. S., Li, W., Luo, Q., Hsiung, W.-P., & Agrawal, D. (2001) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/375663.375736 · Cited by 136
Interpreting stale load information
Dahlin, M. D. (2000) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.888643 · Cited by 113
Web caching and content distribution: a view from the interior
Gadde, S., Chase, J. S., & Rabinovich, M. (2001) · Computer Communications · doi:10.1016/s0140-3664(00)00318-2 · Cited by 100
Design, implementation and performance of a content-based switch
Apostolopoulos, G., Aubespin, D., Peris, V., Pradham, P., & Saha, D. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832470 · Cited by 88
Proactive caching of DNS records: addressing a performance bottleneck
Cohen, E., & Kaplan, H. Y. (2002) · Symposium on Applications and the Internet · doi:10.1109/saint.2001.905171 · Cited by 78
Better operating system features for faster network servers
Bangs, G., Druschel, P., & Mogul, J. C. (1998) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/306225.306234 · Cited by 64
Securing electronic commerce: reducing the SSL overhead
Apostolopoulos, G., Peris, V., Pradhan, P., & Saha, D. (2000) · IEEE Network · doi:10.1109/65.855475 · Cited by 62
Critical path analysis of TCP transactions
Barford, P., & Crovella, M. E. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929848 · Cited by 51
Load Sharing using IP Network Address Translation (LSNAT)
Srisuresh, P., & Gan, D.-H. (1998) · doi:10.17487/rfc2391 · Cited by 38
An evaluation of TCP splice benefits in web proxy servers
Roşu, M., & Roşu, D. (2002) · International World Wide Web Conference (WWW) · doi:10.1145/511446.511449 · Cited by 30
A single system image server cluster using duplicated MAC and IP addresses
Vaidya, S. S., & Christensen, K. J. (2002) · Conference on Local Computer Networks · doi:10.1109/lcn.2001.990789 · Cited by 23
Metadata
- Authors
- Cardellini, V., Casalicchio, E., Colajanni, M., & Yu, P. S.
- Venue
- ACM Computing Surveys
- Published
- 2002-06
- Volume
- 34
- Issue
- 2
- Pages
- 263-311
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W1982648554
- Cited by
- 455
- References
- 33
- FWCI
- 45.51
- Type
- journal article
- Language
- en
- Open access
- green
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
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.