Loss probabilities for messages with redundant packets feeding a finite buffer

Author

Altman, Eitan ; Jean-Marie, Alain

Author_Institution

Inst. Nat. de Recherche en Inf. et Autom., Sophia Antipolis, France

Volume

16

Issue

5

fYear

1998

fDate

6/1/1998 12:00:00 AM

Firstpage

778

Lastpage

787

Abstract

The purpose of this 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. We obtain explicit expressions for the multidimensional generating function of these probabilities based on a recursive scheme introduced by Cidon et al. (1993). We then analyze the loss probabilities of a whole message, and analyze the effect of adding redundant packets. We show that in both heavy traffic as well as in light traffic conditions, adding redundant packets results in decreasing the message loss probabilities

Keywords

buffer storage; packet switching; probability; queueing theory; recursive estimation; telecommunication traffic; M/M/1 queue; consecutive packet arrivals; explicit expressions; finite buffer; heavy traffic; light traffic; loss packet distribution; loss probabilities; message loss probabilities; multidimensional generating function; recursive scheme; redundant packets; Forward error correction; Helium; Loss measurement; Multidimensional systems; Performance loss; Probability; Redundancy; Telecommunication computing; Telecommunication traffic; Traffic control;

fLanguage

English

Journal_Title

Selected Areas in Communications, IEEE Journal on

Publisher

ieee

ISSN

0733-8716

Type

jour

DOI

10.1109/49.700912

Filename

700912