Bounds on the end-to-end loss probability for queues in Series with Finite Capacity

Abstract

We study network of queues in series with finite capacity without blocking of servers but with loss of customers. The contribution of this paper is to obtain upper and lower bounds on the end-to-end loss probability under the assumption that service times are exponentially distributed. This result is obtained using an approach based on sample path comparison. Computational bounds can then be obtained in the special case when the arrival process at the network is Poisson. Numerical results are reported that show the accuracy of the bounds