We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M^X /G/1/n systems.

CEMAT - Center for Computational and Stochastic Mathematics