The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Long-range dependence ten years of Internet traffic modeling
Open accessAbstract
Self-similarity and scaling phenomena have dominated Internet traffic analysis for the past decade. With the identification of long-range dependence (LRD) in network traffic, the research community has undergone a mental shift from Poisson and memory-less processes to LRD and bursty processes. Despite its widespread use, though, LRD analysis is hindered by the difficulty of actually identifying dependence and estimating its parameters unambiguously. The authors outline LRD findings in network traffic and explore the current lack of accuracy and robustness in LRD estimation. In addition, they present recent evidence that packet arrivals appear to be in agreement with the Poisson assumption in the Internet core.
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
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-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
Statistics for Long-Memory Processes.
Ray, W. D., & Beran, J. (1996) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983481 · Cited by 2,686
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‐Similar Network Traffic and Performance Evaluation
(2000) · Wiley eBooks · doi:10.1002/047120644x · Cited by 1,251
Wavelet analysis of long-range-dependent traffic
Abry, P., & Veitch, D. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.650984 · Cited by 956
Queueing systems, volume II: computer applications
Cooper, R. B. (1977) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(77)90118-3 · Cited by 829
Statistics for Long-Memory Processes
Glosup, J., & Beran, J. (1997) · Technometrics · doi:10.2307/1270785 · Cited by 618
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
Cited by
From time series to complex networks: the visibility graph
Lacasa, L., Luque, B., Ballesteros, F., Luque, J., & Nuño, J. C. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709247105 · Cited by 1,826
A Survey on Internet Traffic Identification
Callado, A., Kamienski, C., Szabo, G., Gero, B. P., Kelner, J., Fernandes, S., & Sadok, D. (2009) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2009.090304 · Cited by 378
The visibility graph: A new method for estimating the Hurst exponent of fractional Brownian motion
Lacasa, L., Luque, B., Luque, J., & Nuño, J. C. (2009) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/86/30001 · Cited by 360
Statistical analysis of hydroclimatic time series: Uncertainty and insights
Koutsoyiannis, D., & Montanari, A. (2007) · Water Resources Research · doi:10.1029/2006wr005592 · Cited by 304
Samorodnitsky, G. (2004) · Encyclopedia of Actuarial Science · doi:10.1002/9780470012505.tal018 · Cited by 279
Metadata
- Authors
- Karagiannis, T., Molle, M., & Faloutsos, M.
- Venue
- IEEE Internet Computing
- Published
- 2004-09
- Volume
- 8
- Issue
- 5
- Pages
- 57-64
- ISSN
- 1089-7801 (ISSN-L)
- OpenAlex
- W2112746910
- Cited by
- 290
- References
- 14
- FWCI
- 22.78
- 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.