By Topic

The Accuracy of Markov Chain Models in Predicting Packet-Loss Statistics for a Single Multiplexer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xunqi Yu ; Univ. of Miami, Coral Gables ; Modestino, J.W. ; Xusheng Tian

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 1 )