Discrete-time queues with correlated arrivals and constant service times

A discrete-time single-server finite-capacity queue with correlated arrivals and constant service times of arbitrary length is investigated in this paper. Cells are generated by a bursty on/off source, with geometrically distributed lengths of the on-periods and the off-periods. The performance of the system is evaluated by means of an analytical technique, based on generating functions, whose comutational complexity does not depend on the buffer space. As a result of the analysis, closed-form expressions are obtained for the cell loss ratio, the steady-state probability generating functions of the queue length, the unfinished work and the cell delay and the joint probability generating function of two consecutive interdeparture times at the output of the queue. Some numerical examples illustrate the results.