A Single-Server Queue with Recurrent Input and Exponentially Distributed Service Times

Abstract

Combinatorial methods are given for the determination of the distribution of the queue size, the waiting time, the number of customers served in a busy period and the length of a busy period for a single-server queuing process with recurrent input and exponentially distributed service times.