consecutive customer loss probabilities in m/g/1/n and gi/m(m)//n systems
We address the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k -CCL probability. We derive efficient algorithms to compute k -CCL probabilities in M/G /1/ n and GI/M(m)//n systems for busy periods starting with an arbitrary number of customers in the system that, essentially, reduce to solving either simple recursions or linear systems of equations.
consecutive customer loss probability busy period recursions  gi/m(m)//n  queue  m/g /1-/ n  queue stochastic ordering