Queueing analysis of simple FEC schemes for IP telephony

In interactive voice applications, FEC schemes are necessary for the recovery from packet losses. These schemes need to be simple with a light coding and decoding overhead in order to not impact the interactivity. The objective of this paper is to study a well known simple FEC scheme, in which for every packet n, some redundant information is added in some subsequent packet n+/spl phi/. If packet n is lost, it will be reconstructed in case packet n+/spl phi/ is well received. The quality of the reconstructed copy of packet n will depend on the amount of information on packet n we add to packet n+/spl phi/. We propose a detailed queueing analysis based on a ballot theorem and obtain simple expressions for the audio quality as a function of the amount of redundancy and its relative position to the original information. The analysis shows that this FEC scheme does not scale well and that the quality will deteriorate for any amount of FEC and for any offset /spl phi/.