This paper studies a batch arrival single server Bernoulli feedback queue with Poisson arrivals, two stages of heterogeneous service with different (arbitrary) service time distributions subject to random breakdowns and multiple vacations with exponential distributed with Mean vacation time . After first-stage service the server must provide the second stage service. However after the completio...

Vacation time queues with Markovian arrival process (MAP) are mainly useful in modeling and performance analysis of telecommunication networks based on asynchronous transfer mode (ATM) environment. This paper analyzes a single-server finite capacity queue wherein service is performed in batches of maximum size “b” with a minimum threshold “a” and arrivals are governed by MAP. The server takes a...

Queueing systems with server vacations (server’s performing non-queueing jobs) have been studied extensively since the late 70’s. A considerable number of works in this area were completed in the early 80’s and surveyed by Doshi in 1986. As an extension to the classical queueing system, allowing idle servers to work on non-queueing jobs makes the vacation models more applicable in a variety of ...

A retrial queue with general retrial times, modified vacation policy and Bernoulli feedback is analyzed in this paper. If the server is busy or on vacation, an arriving customer either enters on orbit with probability b, or balks with probability 1-b. Otherwise the service of the arriving customer commences immediately. At the service completion epoch, the test customer may either enter the orb...

In this paper the information theoretic principle of Maximum Entropy (ME) is applied, as a method of inference, towards the study of the M/G/1 queueing model at equilibrium with either single or multiple server vacation periods under both exhaustive and non-exhaustive scheduling schemes. An analytic ME approximation for the characterisation of a universal form for the queue length distribution ...

This paper studies the / / 1 Geo G queue model with , p N policy set-up time, multiple vacation and disasters. The server will start up the random set-up period with the probability p if the customer number is at least N at the end of a random length V of the holiday. Otherwise, the server takes vacation repeatedly with the probability p . Using embedded Markov chain and supplemental variable m...

The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) limited service under the assumption of general arrival, service and setup distributions. The interest for this model is fueled by an application in the field of logistics. Knowledge of the queue length distributions is needed to operate the system properly. The multi-queue po...