Discrete-time analysis of throughput and response time for LAP derivative protocols under Markovian block-error pattern

  • Authors:
  • Y. J. Cho

  • Affiliations:
  • Division of Information and Computer Engineering, Ajou University, 5 Wonchon-Dong Paldal-Gu, Suwon 442-749, South Korea

  • Venue:
  • Computer Communications
  • Year:
  • 1999

Quantified Score

Hi-index 0.24

Visualization

Abstract

We study how well the channel memory can be used in the evaluation of widely used error control schemes. For this we assume a special error pattern named as the simplest Markovian block-error pattern, in which each block is classified into two classes of whether the block transmission is in error or not. We apply the derived pattern to the performance evaluation of the practical link-level procedures, LAPB/D/M with multi-reject options, and investigate both throughput and user-perceived response time behaviors on the discrete-time domain to determine how much the performance of error recovery action is improved under burst error condition. Through numerical examples, we show that the simplest Markovian block-error pattern tends to be superior in throughput and delay characteristics to the random error case. Also, instead of mean alone, we use a new measure of the response time specified as mean plus two standard deviations so as to consider user-perceived worst cases, and show that it results in much greater sensitivity to parameter variations than does mean alone.