Busy periods of discrete-time queues using the Lagrange implicit function theorem

Abstract

In this paper, we study the busy-period distribution for discrete-time queues assuming a Bernoulli arrival process, with arbitrary service-time and batch-arrival distributions. We derive explicit analytic formulas for these distributions using the Lagrange Implicit Function Theorem applied to probability generating functions. The convenient coefficient operator notation used in these formulas leads to a computationally efficient method for obtaining the distributions in their entirety from these analytic formulas.