The accuracy of Markov chain models in predicting packet-loss statistics for a single multiplexer

Xunqi Yu, James W. Modestino, Xusheng Tian

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In this correspondence, we investigate the accuracy of low-complexity discrete-time Markov chain models in characterizing the packet-loss process associated with a transport network whose behavior can be described in terms of a single bottleneck node, modeled by a single multiplexer. The results are useful since network behavior is often characterized in terms of a single bottleneck node and it is of some interest to establish the accuracy of Markov chain models in predicting the packet-loss process on even such a simplified network model. We demonstrate that, although higher order Markov chain models can achieve increasingly more accurate descriptions, the Gilbert model has some serious deficiencies in predicting the packet-loss statistics of the single-multiplexer model for a variety of packet arrival processes. We show that this has some serious consequences for the performance evaluation of forward error correction (FEC) coding schemes using Markov chain models compared to that predicted by an exact queueing analysis of the single-multiplexer model.

Original languageEnglish
Pages (from-to)489-501
Number of pages13
JournalIEEE Transactions on Information Theory
Volume54
Issue number1
DOIs
StatePublished - Jan 1 2008

Fingerprint

Packet loss
Markov processes
statistics
Statistics
Forward error correction
transport network
coding
evaluation
performance

Keywords

  • Forward error correction (FEC) coding
  • Gilbert model
  • Markov chain models
  • Packet recovery
  • Single-multiplexer model

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Information Systems

Cite this

The accuracy of Markov chain models in predicting packet-loss statistics for a single multiplexer. / Yu, Xunqi; Modestino, James W.; Tian, Xusheng.

In: IEEE Transactions on Information Theory, Vol. 54, No. 1, 01.01.2008, p. 489-501.

Research output: Contribution to journalArticle

Yu, Xunqi ; Modestino, James W. ; Tian, Xusheng. / The accuracy of Markov chain models in predicting packet-loss statistics for a single multiplexer. In: IEEE Transactions on Information Theory. 2008 ; Vol. 54, No. 1. pp. 489-501.
@article{9bc5ac76c7ce4b0f898a8246f0eedcb0,
title = "The accuracy of Markov chain models in predicting packet-loss statistics for a single multiplexer",
abstract = "In this correspondence, we investigate the accuracy of low-complexity discrete-time Markov chain models in characterizing the packet-loss process associated with a transport network whose behavior can be described in terms of a single bottleneck node, modeled by a single multiplexer. The results are useful since network behavior is often characterized in terms of a single bottleneck node and it is of some interest to establish the accuracy of Markov chain models in predicting the packet-loss process on even such a simplified network model. We demonstrate that, although higher order Markov chain models can achieve increasingly more accurate descriptions, the Gilbert model has some serious deficiencies in predicting the packet-loss statistics of the single-multiplexer model for a variety of packet arrival processes. We show that this has some serious consequences for the performance evaluation of forward error correction (FEC) coding schemes using Markov chain models compared to that predicted by an exact queueing analysis of the single-multiplexer model.",
keywords = "Forward error correction (FEC) coding, Gilbert model, Markov chain models, Packet recovery, Single-multiplexer model",
author = "Xunqi Yu and Modestino, {James W.} and Xusheng Tian",
year = "2008",
month = "1",
day = "1",
doi = "10.1109/TIT.2007.911152",
language = "English",
volume = "54",
pages = "489--501",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - The accuracy of Markov chain models in predicting packet-loss statistics for a single multiplexer

AU - Yu, Xunqi

AU - Modestino, James W.

AU - Tian, Xusheng

PY - 2008/1/1

Y1 - 2008/1/1

N2 - In this correspondence, we investigate the accuracy of low-complexity discrete-time Markov chain models in characterizing the packet-loss process associated with a transport network whose behavior can be described in terms of a single bottleneck node, modeled by a single multiplexer. The results are useful since network behavior is often characterized in terms of a single bottleneck node and it is of some interest to establish the accuracy of Markov chain models in predicting the packet-loss process on even such a simplified network model. We demonstrate that, although higher order Markov chain models can achieve increasingly more accurate descriptions, the Gilbert model has some serious deficiencies in predicting the packet-loss statistics of the single-multiplexer model for a variety of packet arrival processes. We show that this has some serious consequences for the performance evaluation of forward error correction (FEC) coding schemes using Markov chain models compared to that predicted by an exact queueing analysis of the single-multiplexer model.

AB - In this correspondence, we investigate the accuracy of low-complexity discrete-time Markov chain models in characterizing the packet-loss process associated with a transport network whose behavior can be described in terms of a single bottleneck node, modeled by a single multiplexer. The results are useful since network behavior is often characterized in terms of a single bottleneck node and it is of some interest to establish the accuracy of Markov chain models in predicting the packet-loss process on even such a simplified network model. We demonstrate that, although higher order Markov chain models can achieve increasingly more accurate descriptions, the Gilbert model has some serious deficiencies in predicting the packet-loss statistics of the single-multiplexer model for a variety of packet arrival processes. We show that this has some serious consequences for the performance evaluation of forward error correction (FEC) coding schemes using Markov chain models compared to that predicted by an exact queueing analysis of the single-multiplexer model.

KW - Forward error correction (FEC) coding

KW - Gilbert model

KW - Markov chain models

KW - Packet recovery

KW - Single-multiplexer model

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

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

U2 - 10.1109/TIT.2007.911152

DO - 10.1109/TIT.2007.911152

M3 - Article

AN - SCOPUS:38349132231

VL - 54

SP - 489

EP - 501

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -