Queuing analysis of simple FEC Schemes for voice over IP
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance analysis of two-level forward error correction for lost cell recovery in ATM networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
The ballot theorem strikes again: packet loss process distribution
IEEE Transactions on Information Theory
IEEE/ACM Transactions on Networking (TON)
On the packet loss process at a network node
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
| Hi-index | 0.01 |
The purpose of this paper is to study the loss probabilities of messages in an M/M/1/K queueing system where in addition to losses due to buffer overflow there are also random losses in the incoming and outgoing links. We focus on the influence of adding redundant packets to the messages (as in error correction coding, e.g. Reed-Solomon code, etc.). In the first part we use multi-dimensional probability generating functions for solving the recursions which generalize those introduced by Cidon et al. [IEEE Trans. Inform. Theory 39 (1) (1993) 98] for computing the loss probabilities and derive analytical formulae for a special case. In the second part of the paper we use combinatorial arguments and Ballot theorem results to alternatively obtain the loss probabilities. The analytical results allow us to investigate when does adding redundancy decrease the loss probabilities.