Advances in Regression, Survival Analysis, Extreme Values, Markov Processes and Other Statistical Applications, Springer Berlin Heidelberg, (2013), 163-171 http://dx.doi.org/10.1007/978-3-642-34904-1_17

This chapter addresses TeX queues, i.e., single server batch Markovian arrival queues with finite customer waiting space of size n. Taking profit of the Markov regenerative structure of these systems, we develop an efficient recursive procedure to compute the probability mass function of the number of losses in busy-periods starting with an arbitrary number of customers in the system. The derived computational procedure is easy to implement and leads to a fast numerical computation of the loss probabilities. To illustrate the effectiveness of the procedure, loss probabilities are computed for a wide variety of queues, with different capacities, batch size distributions, and arrival and service parameters.

CEMAT - Center for Computational and Stochastic Mathematics