The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Modeling video traffic using M/G/∞ input processes: a compromise between Markovian and LRD models
Abstract
Statistical evidence suggests that the autocorrelation function p(k) (k=0,1,...) of a compressed-video sequence is better captured by p(k)=e/sup -/spl beta//spl radic/k/ than by p(k)=k/sup -/spl beta//=e/sup -/spl beta/logk/ (long-range dependence) or p(k)=e/sup -/spl beta/k/ (Markovian). A video model with such a correlation structure is introduced based on the so-called M/G//spl infin/ input processes. In essence, the M/G//spl infin/ process is a stationary version of the busy-server process of a discrete-time M/G//spl infin/ queue. By varying G, many forms of time dependence can be displayed, which makes the class of M/G//spl infin/ input models a good candidate for modeling many types of correlated traffic in computer networks. For video traffic, we derive the appropriate G that gives the desired correlation function p(k)=e/sup -/spl beta//spl radic/k/. Though not Markovian, this model is shown to exhibit short-range dependence. Poisson variates of the M/G//spl infin/ model are appropriately transformed to capture the marginal distribution of a video sequence. Using the performance of a real video stream as a reference, we study via simulations the queueing performance under three video models: our M/G//spl infin/ model, the fractional ARIMA model (which exhibits LRD), and the DAR(1) model (which exhibits a Markovian structure). Our results indicate that only the M/G//spl infin/ model is capable of consistently providing acceptable predictions of the actual queueing performance. Furthermore, only O(n) computations are required to generate an M/G//spl infin/ trace of length n, compared to O(n/sup 2/) for an F-ARIMA trace.
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
Association of Random Variables, with Applications
Esary, J. D., Proschan, F., & Walkup, D. W. (1967) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177698701 · Cited by 1,223 · cited 2×
“By the well-known properties of associated rv’s [5], we have”
BackgroundMethod
Cited by
Stock closing price prediction based on sentiment analysis and LSTM
Jin, Z., Yang, Y., & Liu, Y. (2020) · Neural Computing and Applications · doi:10.1007/s00521-019-04504-2 · Cited by 434
Metadata
- Authors
- Krunz, M. M., & Makowski, A. M.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 1998-06
- Volume
- 16
- Issue
- 5
- Pages
- 733-748
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2107494712
- Cited by
- 184
- References
- 1
- FWCI
- 14.25
- 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: Modeling video traffic using M/G/∞ input processes: a compromise between Markovian and LRD models. https://app.cochat.ai/papers/10.1109/49.700909
- The paper
- Krunz, M. M., & Makowski, A. M. (1998). Modeling video traffic using M/G/∞ input processes: a compromise between Markovian and LRD models. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/49.700909
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.