The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
On the relevance of long-range dependence in network traffic
Abstract
There is much experimental evidence that network traffic processes exhibit ubiquitous properties of self-similarity and long-range dependence, i.e., of correlations over a wide range of time scales. However, there is still considerable debate about how to model such processes and about their impact on network and application performance. In this paper, we argue that much previous modeling work has failed to consider the impact of two important parameters, namely the finite range of time scales of interest in performance evaluation and prediction problems, and the first-order statistics such as the marginal distribution of the process. We introduce and evaluate a model in which these parameters can be controlled. Specifically, our model is a modulated fluid traffic model in which the correlation function of the fluid rate matches that of an asymptotically second-order self-similar process with given Hurst parameter up to an arbitrary cutoff time lag, then drops to zero. We develop a very efficient numerical procedure to evaluate the performance of a single-server queue fed with the above fluid input process. We use this procedure to examine the fluid loss rate for a wide range of marginal distributions, Hurst (1950) parameters, cutoff lags, and buffer sizes. Our main results are as follows. First, we find that the amount of correlation that needs to be taken into account for performance evaluation depends not only on the correlation structure of the source traffic, but also on time scales specific to the system under study. For example, the time scale associated with a queueing system is a function of the maximum buffer size. Thus, for finite buffer queues, we find that the impact on loss of the correlation in the arrival process becomes nil beyond a time scale we refer to as the correlation horizon. This means, in particular, that for performance-modeling purposes, we may choose any model among the panoply of available models (including Markovian and self-similar models) as long as the chosen model captures the correlation structure of the source traffic up to the correlation horizon. Second, we find that loss can depend in a crucial way on the marginal distribution of the fluid rate process. Third, our results suggest that reducing loss by buffering is hard for traffic with correlation over many time scales. We advocate the use of source traffic control and statistical multiplexing instead.
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
Discrete-Time Signal Processing
Oppenheim, A. V., & Schafer, R. W. (1989) · Cited by 12,566
Long-Term Storage Capacity of Reservoirs
Hurst, H. E. (1951) · Transactions of the American Society of Civil Engineers · doi:10.1061/taceat.0006518 · Cited by 6,212
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
Queueing Systems. Volume 1: Theory
Kleinrock, L. (1975) · Cited by 1,972
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
Analysis, modeling and generation of self-similar VBR video traffic
Garrett, M. W., & Willinger, W. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190339 · Cited by 976
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
A storage model with self-similar input
Norros, I. (1994) · Queueing Systems · doi:10.1007/bf01158964 · Cited by 848
Cited by
Long-term time series prediction with the NARX network: An empirical evaluation
Menezes, J. M. P., & Barreto, G. A. (2008) · Neurocomputing · doi:10.1016/j.neucom.2008.01.030 · Cited by 446
Lessons learned from eClass: Assessing automated capture and access in the classroom
Brotherton, J. A., & Abowd, G. D. (2004) · ACM Transactions on Computer-Human Interaction · doi:10.1145/1005361.1005362 · Cited by 266
Distributed Routing Strategy Based on Machine Learning for LEO Satellite Network
Na, Z., Pan, Z., Liu, X., Deng, Z., Gao, Z., & Guo, Q. (2018) · Wireless Communications and Mobile Computing · doi:10.1155/2018/3026405 · Cited by 60
Metadata
- Authors
- Grossglauser, M., & Bolot, J.-C.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1999
- Volume
- 7
- Issue
- 5
- Pages
- 629-640
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2119635640
- Cited by
- 296
- References
- 13
- FWCI
- 28.67
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the relevance of long-range dependence in network traffic. https://app.cochat.ai/papers/10.1109/90.803379
- The paper
- Grossglauser, M., & Bolot, J.-C. (1999). On the relevance of long-range dependence in network traffic. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/90.803379
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.