Comparison of Two Approximations for the Loss Probablility in Finite-Buffer Queues

This lecture deals with two related approximations that were recently proposed for the loss probability in finite-buffer queues. The purpose of the lecture is two-fold. First, to provide better insight and more theoretical support for both approximations. Second, to show by an experimental study how well both approximations perform. An interesting empirical finding is that in many cases of practical interest the two approximations provide upper and lower bounds on the exact value of the loss probability. This lecture is based on joined work with professor M. Miyazawa (Science University of Tokyo).