CONTINUOUS-TIME ANALYSIS OF LAP DERIVATIVE PROTOCOLS UNDER MARKOVIAN BLOCK-ERROR PATTERN

In this paper, we investigate how well the channel memory (statistical dependence in the occurrence of transmission errors) can be used in t he evaluation of currently widely used error control schemes. For this we assume a special case named as the simplest Markovian block-error pattern with two states, in which each block is classified into two cl asses of whether the block transmission is in error or not. We apply t he 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 to determi ne how much the performance of error recovery action is improved under burst error condition. Through numerical examples, we show that the s implest Markovian block-error pattern tends to be superior in throughp ut and delay characteristics to the random error case, Also, instead o f mean alone, we propose 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 p arameter variations than does mean alone.