Source model for VBR video traffic based on M/G/∞ input processes

Marwan M Krunz, Armand Makowski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Citations (Scopus)

Abstract

Statistical evidence suggests that the autocorrelation function 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. Though not Markovian, the model exhibits short-range dependence. Using the queueing performance under 'real' video traffic as a reference, we study via simulations the queueing performance under two video models: the M/G/∞ model and the fractional ARIMA (F-ARIMA) model (which exhibits LRD). Our results indicate that the M/G/∞ model is much more accurate in predicting the actual queueing performance than the F-ARIMA model. Furthermore, only O(n) computations are required to generate an M/G/∞ trace of length n, compared to O(n2) for a F-ARIMA trace.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages1441-1448
Number of pages8
Volume3
DOIs
StatePublished - 1998
EventProceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3) - San Francisco, CA, USA
Duration: Mar 29 1998Apr 2 1998

Other

OtherProceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3)
CitySan Francisco, CA, USA
Period3/29/984/2/98

Fingerprint

Autocorrelation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Krunz, M. M., & Makowski, A. (1998). Source model for VBR video traffic based on M/G/∞ input processes. In Proceedings - IEEE INFOCOM (Vol. 3, pp. 1441-1448) https://doi.org/10.1109/INFCOM.1998.662962

Source model for VBR video traffic based on M/G/∞ input processes. / Krunz, Marwan M; Makowski, Armand.

Proceedings - IEEE INFOCOM. Vol. 3 1998. p. 1441-1448.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Krunz, MM & Makowski, A 1998, Source model for VBR video traffic based on M/G/∞ input processes. in Proceedings - IEEE INFOCOM. vol. 3, pp. 1441-1448, Proceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3), San Francisco, CA, USA, 3/29/98. https://doi.org/10.1109/INFCOM.1998.662962
Krunz, Marwan M ; Makowski, Armand. / Source model for VBR video traffic based on M/G/∞ input processes. Proceedings - IEEE INFOCOM. Vol. 3 1998. pp. 1441-1448
@inproceedings{e50399d3fb134a499a6c1ed394364d94,
title = "Source model for VBR video traffic based on M/G/∞ input processes",
abstract = "Statistical evidence suggests that the autocorrelation function 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. Though not Markovian, the model exhibits short-range dependence. Using the queueing performance under 'real' video traffic as a reference, we study via simulations the queueing performance under two video models: the M/G/∞ model and the fractional ARIMA (F-ARIMA) model (which exhibits LRD). Our results indicate that the M/G/∞ model is much more accurate in predicting the actual queueing performance than the F-ARIMA model. Furthermore, only O(n) computations are required to generate an M/G/∞ trace of length n, compared to O(n2) for a F-ARIMA trace.",
author = "Krunz, {Marwan M} and Armand Makowski",
year = "1998",
doi = "10.1109/INFCOM.1998.662962",
language = "English (US)",
isbn = "0780343832",
volume = "3",
pages = "1441--1448",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Source model for VBR video traffic based on M/G/∞ input processes

AU - Krunz, Marwan M

AU - Makowski, Armand

PY - 1998

Y1 - 1998

N2 - Statistical evidence suggests that the autocorrelation function 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. Though not Markovian, the model exhibits short-range dependence. Using the queueing performance under 'real' video traffic as a reference, we study via simulations the queueing performance under two video models: the M/G/∞ model and the fractional ARIMA (F-ARIMA) model (which exhibits LRD). Our results indicate that the M/G/∞ model is much more accurate in predicting the actual queueing performance than the F-ARIMA model. Furthermore, only O(n) computations are required to generate an M/G/∞ trace of length n, compared to O(n2) for a F-ARIMA trace.

AB - Statistical evidence suggests that the autocorrelation function 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. Though not Markovian, the model exhibits short-range dependence. Using the queueing performance under 'real' video traffic as a reference, we study via simulations the queueing performance under two video models: the M/G/∞ model and the fractional ARIMA (F-ARIMA) model (which exhibits LRD). Our results indicate that the M/G/∞ model is much more accurate in predicting the actual queueing performance than the F-ARIMA model. Furthermore, only O(n) computations are required to generate an M/G/∞ trace of length n, compared to O(n2) for a F-ARIMA trace.

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

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

U2 - 10.1109/INFCOM.1998.662962

DO - 10.1109/INFCOM.1998.662962

M3 - Conference contribution

AN - SCOPUS:0031675784

SN - 0780343832

VL - 3

SP - 1441

EP - 1448

BT - Proceedings - IEEE INFOCOM

ER -