The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
On the self-similar nature of Ethernet traffic
Abstract
We demonstrate that Ethernet local area network (LAN) traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal behavior, and that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks. Intuitively, the critical characteristic of this self-similar traffic is that there is no natural length of a "burst": at every time scale ranging from a few milliseconds to minutes and hours, similar-looking traffic bursts are evident; we find that aggregating streams of such traffic typically intensifies the self-similarity ("burstiness") instead of smoothing it.Our 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. We also consider some implications for congestion control in high-bandwidth networks and present traffic models based on self-similar stochastic processes that are simple, accurate, and realistic for aggregate traffic.
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
The Fractal Geometry of Nature
Mandelbrot, B. B., & Wheeler, J. A. (1983) · American Journal of Physics · doi:10.1119/1.13295 · Cited by 21,832
The Fractal Geometry of Nature.
Sparrow, C., & Mandelbrot, B. (1984) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981858 · Cited by 14,546
Fractional Brownian Motions, Fractional Noises and Applications
Mandelbrot, B. B., & Van Ness, J. W. (1968) · SIAM Review · doi:10.1137/1010093 · Cited by 7,645
AN INTRODUCTION TO LONG‐MEMORY TIME SERIES MODELS AND FRACTIONAL DIFFERENCING
Granger, C. W. J., & Joyeux, R. (1980) · Journal of Time Series Analysis · doi:10.1111/j.1467-9892.1980.tb00297.x · Cited by 3,370
Hosking, J. R. M. (1981) · Biometrika · doi:10.1093/biomet/68.1.165 · Cited by 2,773
Some long‐run properties of geophysical records
Mandelbrot, B. B., & Wallis, J. R. (1969) · Water Resources Research · doi:10.1029/wr005i002p00321 · Cited by 991
Packet Trains--Measurements and a New Model for Computer Network Traffic
Jain, R. K., & Routhier, S. (1986) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.1986.1146410 · Cited by 549
Local area network characteristics, with implications for broadband network congestion management
Fowler, H. J., & Leland, W. E. (1991) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.103559 · Cited by 306
Self-citationHigh time-resolution measurement and analysis of LAN traffic: Implications for LAN interconnection
Leland, W. E., & Wilson, D. V. (1991) · IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings · doi:10.1109/infcom.1991.147663 · Cited by 220
Self-citation(2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1498501 · Cited by 152
Statistics, Probability and Chaos
Berliner, L. M. (1992) · Statistical Science · doi:10.1214/ss/1177011444 · Cited by 127
Cited by
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
Self-citationOn power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
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
Network 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
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
Self-citation
Metadata
- Authors
- Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V.
- Venue
- Conference proceedings on Communications architectures, protocols and applications
- Publisher
- ACM
- Published
- 1993-10
- Pages
- 183-193
- OpenAlex
- W2128796442
- Cited by
- 1,077
- References
- 11
- FWCI
- 30.69
- Type
- conference paper
- 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.