Generating representative Web workloads for network and server performance evaluation
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
One role for workload generation is as a means for understanding how servers and networks respond to variation in load. This enables management and capacity planning based on current and projected usage. This paper applies a number of observations of Web server usage to create a realistic Web workload generation tool which mimics a set of real users accessing a server. The tool, called Surge (Scalable URL Reference Generator) generates references matching empirical measurements of 1) server file size distribution; 2) request size distribution; 3) relative file popularity; 4) embedded file references; 5) temporal locality of reference; and 6) idle periods of individual users. This paper reviews the essential elements required in the generation of a representative Web workload. It also addresses the technical challenges to satisfying this large set of simultaneous constraints on the properties of the reference stream, the solutions we adopted, and their associated accuracy. Finally, we present evidence that Surge exercises servers in a manner significantly different from other Web server benchmarks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
On the self-similar nature of Ethernet traffic (extended version)
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.282603 · Cited by 5,233
Willinger, W., Taqqu, M. S., Sherman, R., & Wilson, D. V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.554723 · Cited by 1,654
Evaluation techniques for storage hierarchies
Mattson, R. L., Gecsei, J., Slutz, D. R., & Traiger, I. L. (1970) · IBM Systems Journal · doi:10.1147/sj.92.0078 · Cited by 1,302
Empirically derived analytic models of wide-area TCP connections
Paxson, V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.330413 · Cited by 581
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1996) · Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '96 · doi:10.1145/233013.233038 · Cited by 262
Self-citation(1949) · Max Planck Digital Library
Cited by
Beloglazov, A., & Buyya, R. (2012) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.1867 · Cited by 1,864
A Brief History of Generative Models for Power Law and Lognormal Distributions
Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129088 · Cited by 1,188
Analyzing Peer-To-Peer Traffic Across Large Networks
Sen, S., & Wang, J. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.826277 · Cited by 586
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
A "flight data recorder" for enabling full-system multiprocessor deterministic replay
Xu, M., Bodik, R., & Hill, M. D. (2003) · Proceedings of the 30th annual international symposium on Computer architecture - ISCA '03 · doi:10.1145/859618.859633 · Cited by 395
Towards characterizing cloud backend workloads: insights from Google compute clusters
Mishra, A. K., Hellerstein, J. L., Cirne, W., & Das, C. R. (2010) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1773394.1773400 · Cited by 374
Workload characterization and prediction in the cloud: A multiple time series approach
Khan, A., Yan, X., Tao, S., & Anerousis, N. (2012) · 2012 IEEE Network Operations and Management Symposium · doi:10.1109/noms.2012.6212065 · Cited by 305
An energy-efficient VM placement method for cloud data centers using a hybrid genetic algorithm
Kaaouache, M. A., & Bouamama, S. (2018) · Journal of Systems and Information Technology · doi:10.1108/jsit-10-2017-0089 · Cited by 18
Metadata
- Authors
- Barford, P., & Crovella, M.
- Venue
- ACM SIGMETRICS Performance Evaluation Review
- Published
- 1998-06
- Volume
- 26
- Issue
- 1
- Pages
- 151-160
- ISSN
- 0163-5999 (ISSN-L)
- OpenAlex
- W3007863253
- Cited by
- 442
- References
- 6
- FWCI
- 12.31
- 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
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.