In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which customers are served in each queue is determined by a priority level that is assigned to each customer at his arrival. For this situation the following service disciplines are considered: gated, exhaustive, and globally gate...

In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and low priority customers. For this situation the following service disciplines are considered: gated, globally gated, and exhaustive. We study the cycle time dis...

The so-called “Israeli queue” (Boxma et al. in Stoch Model 24(4):604– 625, 2008; Perel and Yechiali in Probab Eng Inf Sci, 2013; Perel and Yechiali in Stoch Model 29(3):353–379, 2013) is a multi-queue polling-type system with a single server. Service is given in batches, where the batch sizes are unlimited and the service time of a batch does not depend on its size. After completing service, th...

Abstract: This paper examines the steady state behavior of an M/G/1 queue with repeated attempts in which the server may provide an additional second phase of service. This model generalizes both the classical M/G/1 retrial queue and the M/G/1 queue with classical waiting line and second optional service. We carry out an extensive stationary analysis of the system, including existence of statio...

Using a queuing approach to describe a shared memory parallel computer system, it can be considered as a parallel computer system with a shared single ready queue. This can depict a single queue parallel server queuing model. Some models that are based on probability density function have been used to model the performance of the queuing system. This paper uses recursive models to evaluate the ...

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

There are n queues, each with a single server. Customers arrive in a Poisson process at rate λn, where 0 < λ < 1. Upon arrival each customer selects d ≥ 2 servers uniformly at random, and joins the queue at a leastloaded server among those chosen. Service times are independent exponentially distributed random variables with mean 1. We show that the system is rapidly mixing, and then investigate...

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

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

This paper applies importance sampling simulation for estimating rare-event probabilities of the first passage time in the infinite server queue with renewal arrivals and general service time distributions. We consider importance sampling algorithms which are based on large deviations results of the infinite server queue, and we consider an algorithm based on the cross-entropy method, where we ...