Modeling video traffic using M/G/∞ input processes: A compromise between Markovian and LRD models

Marwan M Krunz, A. M. Makowski

Research output: Contribution to journalArticle

139 Citations (Scopus)

Abstract

Statistical evidence suggests that the autocorrelation function ρ (k) (k = 0, 1, ⋯) of a compressed-video sequence is better captured by ρ(k) = e-β√k than by ρ(k) = k = e-βlog k (long-range dependence) or ρ(k) = e-βk (Markovian). A video model with such a correlation structure is introduced based on the so-called M/G/∞ input processes. In essence, the M/G/∞ process is a stationary version of the busy-server process of a discrete-time M/G/∞ queue. By varying G, many forms of time dependence can be displayed, which makes the class of M/G/∞ 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 ρ(k) =e-β√ki . Though not Markovian, this model is shown to exhibit short-range dependence. Poisson variates of the M/G/∞ 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/∞ model, the fractional ARIMA model [9] (which exhibits LRD), and the DAR(1) model (which exhibits a Markovian structure). Our results indicate that only the M/G/∞ model is capable of consistently providing acceptable predictions of the actual queueing performance. Furthermore, only script O sign(n) computations are required to generate an M/G/∞ trace of length n, compared to script O sign(n2) for an F-ARIMA trace.

Original languageEnglish (US)
Pages (from-to)733-748
Number of pages16
JournalIEEE Journal on Selected Areas in Communications
Volume16
Issue number5
DOIs
StatePublished - Jun 1998

Fingerprint

Computer networks
Autocorrelation
Servers

Keywords

  • Correlated variates
  • M/G/∞ process
  • Traffic modeling
  • VBR video

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Modeling video traffic using M/G/∞ input processes : A compromise between Markovian and LRD models. / Krunz, Marwan M; Makowski, A. M.

In: IEEE Journal on Selected Areas in Communications, Vol. 16, No. 5, 06.1998, p. 733-748.

Research output: Contribution to journalArticle

@article{289a518c692446679ddc230100ade44d,
title = "Modeling video traffic using M/G/∞ input processes: A compromise between Markovian and LRD models",
abstract = "Statistical evidence suggests that the autocorrelation function ρ (k) (k = 0, 1, ⋯) of a compressed-video sequence is better captured by ρ(k) = e-β√k than by ρ(k) = k-β = e-βlog k (long-range dependence) or ρ(k) = e-βk (Markovian). A video model with such a correlation structure is introduced based on the so-called M/G/∞ input processes. In essence, the M/G/∞ process is a stationary version of the busy-server process of a discrete-time M/G/∞ queue. By varying G, many forms of time dependence can be displayed, which makes the class of M/G/∞ 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 ρ(k) =e-β√ki . Though not Markovian, this model is shown to exhibit short-range dependence. Poisson variates of the M/G/∞ 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/∞ model, the fractional ARIMA model [9] (which exhibits LRD), and the DAR(1) model (which exhibits a Markovian structure). Our results indicate that only the M/G/∞ model is capable of consistently providing acceptable predictions of the actual queueing performance. Furthermore, only script O sign(n) computations are required to generate an M/G/∞ trace of length n, compared to script O sign(n2) for an F-ARIMA trace.",
keywords = "Correlated variates, M/G/∞ process, Traffic modeling, VBR video",
author = "Krunz, {Marwan M} and Makowski, {A. M.}",
year = "1998",
month = "6",
doi = "10.1109/49.700909",
language = "English (US)",
volume = "16",
pages = "733--748",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Modeling video traffic using M/G/∞ input processes

T2 - A compromise between Markovian and LRD models

AU - Krunz, Marwan M

AU - Makowski, A. M.

PY - 1998/6

Y1 - 1998/6

N2 - Statistical evidence suggests that the autocorrelation function ρ (k) (k = 0, 1, ⋯) of a compressed-video sequence is better captured by ρ(k) = e-β√k than by ρ(k) = k-β = e-βlog k (long-range dependence) or ρ(k) = e-βk (Markovian). A video model with such a correlation structure is introduced based on the so-called M/G/∞ input processes. In essence, the M/G/∞ process is a stationary version of the busy-server process of a discrete-time M/G/∞ queue. By varying G, many forms of time dependence can be displayed, which makes the class of M/G/∞ 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 ρ(k) =e-β√ki . Though not Markovian, this model is shown to exhibit short-range dependence. Poisson variates of the M/G/∞ 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/∞ model, the fractional ARIMA model [9] (which exhibits LRD), and the DAR(1) model (which exhibits a Markovian structure). Our results indicate that only the M/G/∞ model is capable of consistently providing acceptable predictions of the actual queueing performance. Furthermore, only script O sign(n) computations are required to generate an M/G/∞ trace of length n, compared to script O sign(n2) for an F-ARIMA trace.

AB - Statistical evidence suggests that the autocorrelation function ρ (k) (k = 0, 1, ⋯) of a compressed-video sequence is better captured by ρ(k) = e-β√k than by ρ(k) = k-β = e-βlog k (long-range dependence) or ρ(k) = e-βk (Markovian). A video model with such a correlation structure is introduced based on the so-called M/G/∞ input processes. In essence, the M/G/∞ process is a stationary version of the busy-server process of a discrete-time M/G/∞ queue. By varying G, many forms of time dependence can be displayed, which makes the class of M/G/∞ 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 ρ(k) =e-β√ki . Though not Markovian, this model is shown to exhibit short-range dependence. Poisson variates of the M/G/∞ 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/∞ model, the fractional ARIMA model [9] (which exhibits LRD), and the DAR(1) model (which exhibits a Markovian structure). Our results indicate that only the M/G/∞ model is capable of consistently providing acceptable predictions of the actual queueing performance. Furthermore, only script O sign(n) computations are required to generate an M/G/∞ trace of length n, compared to script O sign(n2) for an F-ARIMA trace.

KW - Correlated variates

KW - M/G/∞ process

KW - Traffic modeling

KW - VBR video

UR - http://www.scopus.com/inward/record.url?scp=0032097569&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032097569&partnerID=8YFLogxK

U2 - 10.1109/49.700909

DO - 10.1109/49.700909

M3 - Article

AN - SCOPUS:0032097569

VL - 16

SP - 733

EP - 748

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 5

ER -