 Abstract—This paper considers a Geo/G/1 queue, in which the server operates a single vacation at end of each consecutive service period. After all the customers in the system are served exhaustively, the server immediately leaves for a vacation. Upon returning from the vacation, the server inspects the queue length. If there are customers waiting in the queue, the server either resumes servin...

We consider the discrete-time gated multiple-vacation queue. Vacations are modeled as independent random variables with distributions depending on the number of the immediately preceding vacations. Using a probability generating function approach, we focus on various performance measures such as moments of queue contents and customer delay in equilibrium. These measures are functions of a const...

We show how to implement a bounded time queue for two different processes. The time queue is a variant of a priority queue with elements from a discrete universe. The bounded time queue has elements from a discrete bounded universe. One process has time constraints and may only spend constant worst case time on each operation while the other process may spend more time. The time constrained pro...

In this paper, we consider a discrete-time single-server queueing system with a generalized switched batch Bernoulli arrival and a general service time processes (a generalized SBBP=G=1 queue). Customers arrive to the system in batches and service times of customers are generally distributed. The batch size and the service time distributions are governed by a discrete-time alternating renewal p...

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discrete Markovian service process. The server terminates service whenever the system becomes empty, and recommences service as soon as the number of waiting customers in the queue is N . We obtain the system-length distributions at prearrival and arbitrary epochs using the supplement...