Queueing Systems. Theory and Applications., 58(2) (2008), 121-136 http://dx.doi.org/10.1007/s11134-008-9063-z 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.