The loss process of messages in an M/M/1/K queue

The purpose in the paper is to obtain the distribution of the number of lost packets within a sequence of n consecutive packet arrivals into a finite buffer M/M/1 queue. The authors obtain explicit expressions for the multi-dimensional generating function of these probabilities based on a recursive scheme introduced by Cidon et al. (1993)They then analyze the loss probabilities of a whole message, and analyze the effect of adding redundant packets. They show that in both heavy traffic as well as in light traffic conditions, adding redundant packets results in decreasing the message loss probabilities