The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Empirically derived analytic models of wide-area TCP connections
Open accessAbstract
Analyzes 3 million TCP connections that occurred during 15 wide-area traffic traces. The traces were gathered at five "stub" networks and two internetwork gateways, providing a diverse look at wide-area traffic. The author derives analytic models describing the random variables associated with TELNET, NNTP, SMTP, and FTP connections. To assess these models the author presents a quantitative methodology for comparing their effectiveness with that of empirical models such as Tcplib [Danzig and Jamin, 1991]. The methodology also allows to determine which random variables show significant variation from site to site, over time, or between stub networks and internetwork gateways. Overall the author finds that the analytic models provide good descriptions, and generally model the various distributions as well as empirical models.>
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
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
Self-citationAsymptotic Theory of Certain "Goodness of Fit" Criteria Based on Stochastic Processes
Anderson, T. W., & Darling, D. A. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729437 · Cited by 3,542 · cited 1×
“The authors of [DS86], however, recommend the Anderson-Darling ( 2) test [ AD54 ] instead.”
MethodKoziol, J. A., D'Agostino, R. B., & Stephens, M. A. (1987) · Journal of Educational Statistics · doi:10.2307/1165059 · Cited by 1,982
On optimal and data-based histograms
SCOTT, D. W. (1979) · Biometrika · doi:10.1093/biomet/66.3.605 · Cited by 1,819
Holder, R. L., Mosteller, F., & Tukey, J. W. (1979) · Applied Statistics · doi:10.2307/2346739 · Cited by 1,676
Osborn, J. F., Mosteller, F., & Tukey, J. W. (1978) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344493 · Cited by 1,446
On the self-similar nature of Ethernet traffic
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1993) · Conference proceedings on Communications architectures, protocols and applications · doi:10.1145/166237.166255 · Cited by 1,077
Introduction to Probability and Statistics for Engineers and Scientists
Reynolds, M. R. (1988) · Technometrics · doi:10.1080/00401706.1988.10488450 · Cited by 989
The BSD packet filter: a new architecture for user-level packet capture
McCanne, S., & Jacobson, V. L. (1993) · Cited by 885
Cited by
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
Self-citationSelf-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
Bro: a system for detecting network intruders in real-time
Paxson, V. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00112-7 · Cited by 2,636
Self-citationNetwork traffic characteristics of data centers in the wild
Benson, T., Akella, A., & Maltz, D. A. (2010) · Proceedings of the 10th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1879141.1879175 · Cited by 2,214
A survey of techniques for internet traffic classification using machine learning
Nguyen, T. T. T., & Armitage, G. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2008.080406 · Cited by 1,664
Generating representative Web workloads for network and server performance evaluation
Barford, P., & Crovella, M. (1998) · Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems · doi:10.1145/277851.277897 · Cited by 1,431
Toward developing a systematic approach to generate benchmark datasets for intrusion detection
Shiravi, A., Shiravi, H., Tavallaee, M., & Ghorbani, A. A. (2012) · Computers & Security · doi:10.1016/j.cose.2011.12.012 · Cited by 1,345
Internet traffic classification using bayesian analysis techniques
Moore, A. W., & Zuev, D. (2005) · Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/1064212.1064220 · Cited by 1,208
Youtube traffic characterization: a view from the edge
Gill, P., Arlitt, M., Li, Z., & Mahanti, A. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298310 · Cited by 852
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
Web server workload characterization: the search for invariants
Arlitt, M. F., & Williamson, C. L. (1996) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/233008.233034 · Cited by 747
Internet Web servers: workload characterization and performance implications
Arlitt, M. F., & Williamson, C. L. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649565 · Cited by 730
Difficulties in simulating the Internet
Floyd, S., & Paxson, V. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.944338 · Cited by 721
Self-citationTraffic classification using clustering algorithms
Erman, J., Arlitt, M., & Mahanti, A. (2006) · Proceedings of the 2006 SIGCOMM workshop on Mining network data · doi:10.1145/1162678.1162679 · Cited by 708
End-to-end routing behavior in the Internet
Paxson, V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649563 · Cited by 698
Self-citationMeasurements and analysis of end-to-end Internet dynamics
Paxson, V. (1997) · doi:10.2172/551971 · Cited by 572
Self-citationSelf-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1996) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/233008.233038 · Cited by 520
Roughan, M., Sen, S., Spatscheck, O., & Duffield, N. (2004) · Proceedings of the 4th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1028788.1028805 · Cited by 494
A quantitative comparison of graph-based models for Internet topology
Zegura, E. W., Calvert, K. L., & Donahoo, M. J. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650138 · Cited by 482
Internet traffic classification using bayesian analysis techniques
Moore, A. W., & Zuev, D. (2005) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1071690.1064220 · Cited by 460
Generating representative Web workloads for network and server performance evaluation
Barford, P., & Crovella, M. (1998) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/277858.277897 · Cited by 442
Traffic classification through simple statistical fingerprinting
Crotti, M., Dusi, M., Gringoli, F., & Salgarelli, L. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1198255.1198257 · Cited by 396
Characteristics of internet background radiation
Pang, R., Yegneswaran, V., Barford, P., Paxson, V., & Peterson, L. (2004) · Proceedings of the 4th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1028788.1028794 · Cited by 374
Self-citationA parameterizable methodology for Internet traffic flow profiling
Claffy, K. C., Braun, H.-W., & Polyzos, G. C. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.464717 · Cited by 330
Heavy tail modeling and teletraffic data: special invited paper
Resnick, S. I. (1997) · The Annals of Statistics · doi:10.1214/aos/1069362376 · Cited by 288
Offline/realtime traffic classification using semi-supervised learning
Erman, J., Mahanti, A., Arlitt, M., Cohen, I., & Williamson, C. (2007) · Performance Evaluation · doi:10.1016/j.peva.2007.06.014 · Cited by 287
Wide-area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190338 · Cited by 281
Self-citationSupport Vector Machines for TCP traffic classification
Este, A., Gringoli, F., & Salgarelli, L. (2009) · Computer Networks · doi:10.1016/j.comnet.2009.05.003 · Cited by 270
Trajectory sampling for direct traffic observation
Duffield, N. G., & Grossglauser, M. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929851 · Cited by 260
Identifying and discriminating between web and peer-to-peer traffic in the network core
Erman, J., Mahanti, A., Arlitt, M., & Williamson, C. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242692 · Cited by 213
KISS: Stochastic Packet Inspection Classifier for UDP Traffic
Finamore, A., Mellia, M., Meo, M., & Rossi, D. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2010.2044046 · Cited by 130
“This clearly shows that while KISS is not suitable for the classifi-cation of short-lived UDP flows/endpoints, it can however successfully target the small fraction of them that generates the majority of the traffic, i.e., long-lived flows.”
Background
Metadata
- Authors
- Paxson, V.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1994
- Volume
- 2
- Issue
- 4
- Pages
- 316-336
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2103312864
- Cited by
- 581
- References
- 14
- FWCI
- 26.66
- 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.