The DOI matches its Crossref record.
On the self-similar nature of Ethernet traffic (extended version)
Abstract
Demonstrates that Ethernet LAN traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal-like behavior, that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks, and that aggregating streams of such traffic typically intensifies the self-similarity ("burstiness") instead of smoothing it. These conclusions are supported by a rigorous statistical analysis of hundreds of millions of high quality Ethernet traffic measurements collected between 1989 and 1992, coupled with a discussion of the underlying mathematical and statistical properties of self-similarity and their relationship with actual network behavior. The authors also present traffic models based on self-similar stochastic processes that provide simple, accurate, and realistic descriptions of traffic scenarios expected during B-ISDN deployment.>
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
Cited by
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
Recommendations on Queue Management and Congestion Avoidance in the Internet
Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., et al. (1998) · doi:10.17487/rfc2309 · Cited by 1,318
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
Yu, S.-Z. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2009.11.011 · Cited by 734
The BLUE active queue management algorithms
Feng, W.-C., Shin, K. G., Kandlur, D. D., & Saha, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801399 · Cited by 576
Shrinkage Algorithms for MMSE Covariance Estimation
Chen, Y., Wiesel, A., Eldar, Y. C., & Hero, A. O. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2053029 · Cited by 567
Analytic evaluation of RED performance
Bonald, T., May, M., & Bolot, J.-C. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832539 · Cited by 405
Dynamically forecasting network performance using the Network Weather Service
Wolski, R. (1998) · Cluster Computing · doi:10.1023/a:1019025230054 · Cited by 395
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
Is Network Traffic Appriximated by Stable Lévy Motion or Fractional Brownian Motion?
Mikosch, T., Resnick, S., Rootzén, H., & Stegeman, A. (2002) · The Annals of Applied Probability · doi:10.1214/aoap/1015961155 · Cited by 270
An efficient forward-backward algorithm for an explicit-duration hidden Markov model
Yu, S.-Z., & Kobayashi, H. (2003) · IEEE Signal Processing Letters · doi:10.1109/lsp.2002.806705 · Cited by 226
Hao, W., Yang, T., & Yang, Q. (2023) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2021.3073396 · Cited by 143
Support vector regression for link load prediction
Bermolen, P., & Rossi, D. (2009) · Computer Networks · doi:10.1016/j.comnet.2008.09.018 · Cited by 121
TCP implementations and false time out detection in OBS networks
Yu, X., Qiao, C., & Liu, Y. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1356966 · Cited by 92
IEC61850–Based Systems—Functional Testing and Interoperability Issues
Manassero, G., Pellini, E. L., Senger, E. C., & Nakagomi, R. M. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2217977 · Cited by 37
Metadata
- Authors
- Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1994
- Volume
- 2
- Issue
- 1
- Pages
- 1-15
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2105818147
- Cited by
- 5,233
- References
- 0
- FWCI
- 108.37
- 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.
