LOSS PROBABILITIES FOR MESSAGES WITH REDUNDANT PACKETS FEEDING A FINITE BUFFER

Our purpose in this paper is to obtain the distribution of the number of lost packets within a sequence of n consecutive packet arrivals int o a finite buffer M/M/1 queue. We obtain explicit expressions for the multidimensional generating function of these probabilities based on a recursive scheme recently introduced by Cidon et al. We then analyze the loss probabilities of a whole message, and analyze the effect of a dding redundant packets. We show that in both heavy traffic as well as in light traffic conditions, adding redundant packets results in decr easing the message loss probabilities.