We consider a finite-buffer single-server queue with Markovian arrival process (MAP) where the server serves a limited number of customers, and when the limit is reached it goes on vacation. Both singleand multiple-vacation policies are analyzed and the queue length distributions at various epochs, such as pre-arrival, arbitrary, departure, have been obtained. The effect of certain model parame...

This paper presents an analysis of a cyclic-service tandem queue (M/C/l type queue) with exhaustive services and multiple server vacations, in which a single server takes repeated vacations until it finds at least one message in the first queue after emptying the queueing system. It is assumed that the vacation time is generally distributed, and switch-over times are zero. This paper analyzes q...

the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract We consider an M [x] /G/1 queue with two types of service subject to random breakdowns having multiple server vacation, where the customers arrive to the system in batches of variable size. We assume that a single server p...

This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and takes a single vacation of random length V . When he returns, if the queue length reaches or exceeds threshold ( 1) N N  , the server is immediately turned on but is temporarily unava...

This paper deals with finite-population, single and multi-server queueing systems with two classes of vacation mechanisms : station vacation and server vacation. In the first one, all the servers take vacation simultaneously whenever the system becomes empty, and they also return to the system at the same time, i.e., station vacation is group vacation for all servers. For the second class of va...

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

this paper analyzes renewal input state dependent queue with $n$- policy wherein the server takes exactly one vacation. using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. various performance measures has been presented. finally, some numerical  computations in the form of graphs are presented to show the par...

In this paper a single server preemptive priority queuing system consisting of two types of customer units with Poisson arrival, exponential service time distribution and exponential vacation is analyzed. Two type of customer units of which higher priority units of unlimited Poisson input are served by bulk service rule and limited Poisson input of low priority units served singly. The bulk ser...

This study considers a -policy Geo/G/1 queue with startup and closedown times. The -policy operates as follows. On completion of the vacation, if there are customers in the queue, the server is either to activate with probability p or to stay dormant in the system with probability 1-p for waiting a new arrival; and if no customer presents in the queue, the server obeys classical sin...

The author presents performance analysis of a single buffer multiple-queue system. Four different types of service disciplines (i.e., non-preemptive, pre-emptive repeat different, state dependent random polling and globally gated) are analyzed. His model includes correlated input process and three different types of nonproductive time (i.e., switchover, vacation and idle time). Special cases of...