Performance analysis of a discrete-time Geo/G/1 queue with randomized vacations and at most J vacations

Abstract

This paper presents the analysis of a discrete-time Geo/G/1 queue with randomized vacations. Using the probability decomposition theory and renewal process, two variants on this model, namely the late arrival system with delayed access (LAS-DA) and early arrival system (EAS), have been examined. For both the cases, recursive solution for queue length distributions at arbitrary, just before a potential arrival, pre-arrival, immediately after potential departure, and outside observer’s observation epochs are obtained. Further, various performance measures such as potential blocking probability, turned-on period, turned-off period, vacation period, expected length of the turned-on circle period, average queue length and sojourn time, etc. have been presented. It is hoped that the results obtained in this paper may provide useful information to designers of telecommunication systems, practitioners, and others.