A decomposition result for single server discrete-time queues with generalized vacations

Abstract

For several specific discrete-time queueing models with a vacation policy, the stationary system occupancy at the beginning of a random slot is distributed as the sum of two independent random variables. One of these variables is the stationary number of customers in an equivalent queueing system with no vacations. This paper aims to show that this decomposition can be applied to for a large class of discrete-time queueing systems with vacations. The analysis builds on results obtained by Fuhrmann and Cooper concerning continuous-time queueing systems with Poissonian arrivals. Through some examples we show that the queueing analysis can be considerably simplified using this decomposition property.