Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 207

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Self‐Similar Network Traffic: An Overview

Park, Kihong, Willinger, Walter · 2000 · Self‐Similar Network Traffic and Performance Evaluation

Abstract

Since the seminal study of Leland, Taqqu, Willinger, and Wilson, which set the groundwork for considering self-similarity an important notion in the understanding of network traffic including the modeling and analysis of network performance, an explosion of work has ensued investigating the multifaceted nature of this phenomenon. The long-held paradigm in the communication and performance communities has been that voice traffic and, by extension, data traffic are adequately described by certain Markovian models (e.g., Poisson), which are amenable to accurate analysis and efficient control. The first property stems from the well-developed field of Markovian analysis, which allows tight equilibrium bounds on performance variables such as the waiting time in various queueing systems to be found. This also forms a pillar of performance analysis from the queueing theory side. The second feature is, in part, due to the simple correlation structure generated by Markovian sources whose performance impact—for example, as affected by the likelihood of prolonged occurrence of “bad events” such as concentrated packet arrivals—is fundamentally well-behaved. Specifically, if such processes are appropriately rescaled in time, the resulting coarsified processes rapidly lose dependence, taking on the properties of an independent and identically distributed sequence of random variables with its associated niceties. Principal among them is the exponential smallness of rare events, a key observation at the center of large deviations theory. The behavior of a process under rescaling is an important consideration in performance analysis and control since buffering and, to some extent, bandwidth provisioning can be viewed as operating on the rescaled process. The fact that Markovian systems admit to this avenue of taming variability has helped shape the optimism permeating the late 1980s and early 1990s regarding the feasibility of achieving efficient traffic control for quality of service (QoS) provisioning. The discovery and, more importantly, succinct formulation and recognition that data traffic may not exhibit the hereto accustomed scaling properties have significantly influenced the networking landscape, necessitating a reexamination of some of its fundamental premises.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/047120644x.ch1

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 207

Metadata

Authors
Park, K., & Willinger, W.
Venue
Self‐Similar Network Traffic and Performance Evaluation
Publisher
Wiley
Published
2000-08-21
Pages
1-38
OpenAlex
W1671522217
Cited by
207
References
1
Type
other
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Self‐Similar Network Traffic: An Overview. https://app.cochat.ai/papers/10.1002/047120644x.ch1
The paper
Park, K., & Willinger, W. (2000). Self‐Similar Network Traffic: An Overview. Self‐Similar Network Traffic and Performance Evaluation. https://doi.org/10.1002/047120644x.ch1

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.