|
|
|
|
|
|
|
The effect of adding redundancy to an input stream on the losses that occur due to the buffer overflow is studied. We consider several sessions that generate traffic into a finite capacity queue. Multi-dimensional generating functions of loss probabilities are derived explicitly. Then, using the asymptotic analysis, we obtain good approximations of loss probabilities with very low complexity of computation and memory and we investigate when does adding redundancy decrease the loss probabilities. For any stationary ergodic arrival sequence, we also compute the required number of packets in block and the amount of redundancy which allows to eliminate the losses to an arbitrary small value.
|
|
|
|
|
|
|
|