In this paper we analyze the packet loss process in a single server queueing system with a nite bu er capacity. The model we use addresses the packet loss probabilities for packets within a block of consecutive sequence of packets. In contrast to other work which used an independence assumption to compute the loss probabilities of packets within a block, we present an analytical approach that yields e cient recursions for the computation of the distribution of the number of lost packets within a block of packets of xed or variable size for several arrival models and a several number of sessions. Numerical examples are provided to compare the distribution obtained from our analysis with the distribution obtained by using the independence assumption. The results give insight to the following areas related to high-speed networks: (i) Forward error correction schemes become less e cient due to the bursty nature of the packet loss processes. (ii) Real time tra c such as voice and video might be more sensitive to network congestion than was previously assumed. (iii) The retransmission probability of ATM messages has been over-estimated by the use of independence assumption.
In REF , Cidon et al. presented an exact analysis of the packet loss process in an M/M/1/K queue, that is the probability of losing j packets in a block of n packets, and showed that the distribution of losses may be bursty compared to the assumption of independence.
Analysis of Packet Loss Processes in High-Speed Networks
IEEE Transactions on Information Theory
Computer Science