This paper analyzes a single-server finite-buffer vacation (single and multiple) queue wherein the input process follows a discrete-time batch Markovian arrival process (D-BMAP). The service and vacation times are generally distributed and their durations are integral multiples of a slot duration. We obtain the state probabilities at service completion, vacation termination, arbitrary, and prea...

In this paper, we consider a queueing model for machine repairing system with Bernoulli vacation schedule. The failure times, repair times and vacation times are all assumed to be exponentially distributed. In congestion, the server may increase the repair rate with pressure coefficient  to reduce the queue length. We assume that the server begins the working vacation when the system is empty....

Abstract: We consider a discrete-time 1 X Geo G retrial queue with general retrial times, and introduce working vacations and vacation interruption policy into the retrial queue. Firstly, we analyze the stationary condition for the embedded Markov chain at the departure epochs. Secondly, using supplementary variable method, we obtain the stationary probability distribution and some performance ...

We consider a GI/M/1 queueing system in which the server takes exactly one exponential vacation each time the system empties. We derive the PGF of the stationary queue length and the LST of the stationary FIFO sojourn time. We show that both the queue length and the sojourn time can be stochastically decomposed into meaningful quantities.

In this paper we consider the analysis of M/G/1 queue with working vacation. In contrast to the previous literature where the working vacation starts when all customers are served (exhaustive discipline) we consider the case where the vacation period starts when the customers present at the system at beginning of the service period are served (gated discipline). The analysis of the model with g...

We consider an M/G/1 retrial queue with general retrial times and single working vacation. During the working vacation period, customers can be served at a lower rate. Both service times in a vacation period and in a service period are generally distributed random variables. Using supplementary variable method we obtain the probability generating function for the number of customers and the ave...

This paper deals with the transient analysis of batch arrival retrial queueing system with general retrial times, priority service, balking, second optional service, Bernoulli vacation, extended vacation, breakdown, delayed repair and stand by server. Here we assume that customers arrive in batches according to compound Poisson processes, where the blocked customers either with probability p jo...

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...

In this contribution we investigate discrete-time queueing systems with vacations. A framework is constructed that allows for studying numerous different vacation systems, including a.o. classical vacation systems like the exhaustive and limited vacation systems as well as queueing systems with service interruptions. Using a probability generating functions approach, we obtain steady-state perf...

This paper refers to some closed two-stage queueing systems with state-dcpendent vacation policy. By means of the markovian rcnewal process and the stochastic decomposition formulas of the quantities in equilibrium for M/Gjl vacation models, we derive both stationary distributions of the queue length and the cyclic time for the closed state-dependcnt vacation model. We try to so!\'e the problem...