Motivated by the fault tolerance for manufacturing, we investigate a renewal input bulk arrival queue with fault-tolerant server, in which server can keep working low service rate even if partial failure occurs. Only when there are no customers system, be removed. To explore performance measures of queue, more generic and simpler algorithm based on right shift operator method solving difference...

We determine the time-dependent performance of a deterministic fluid model that approximates the many-server Gt/GI/st + GI queueing model. The model has a time-varying arrival rate and service capacity, abandonment from queue, and non-exponential service and patience distributions. Our key assumptions are that (i) the system alternates between overloaded and underloaded intervals, and (ii) the ...

This paper studies the M /G/1 queue where a special (test) customer can get service only if he has simultaneous access to the server and a second resource. All other customers only need access to the server. The second resource becomes available after an exponentially distributed amount of time. The ordinary customers are served according to the FIFO discipline. The test customer has the freedo...

In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson arrivals. The service disciplines that are discussed, are exhaustive and gated service. The novel contribution of the present paper is that we consider the reneging of customers at polling instants. In more detail, whenever the server starts or ends a visit to a queue, some of the customers waiti...

Modern computer systems are based on a wide variety of software servers, such as web servers, application servers, database servers, and mail servers. The typical software architecture of such servers includes a set of processes or threads that serve requests submitted to the server. Requests that arrive at the server and find all threads busy, are placed in a queue. Threads that are busy execu...

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

Scheduling policies in multi-queue multi-server systems need to allocate servers based on the channel state information and the queue state information. In the downlink, channel state information available to the scheduler may be imperfect due to feedback delay and estimation errors. Motivated by this, we consider the downlink scheduling problem of allocating servers to multi-queue multi-server...

 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 a Jackson-type network comprised of 2 queues having state-dependent service rates, in which the queue lengths evolve periodically, exhibiting noisy cycles. To reduce this noise a certain heuristic, utilizing regions in the phase space in which the system behaves almost deterministically, is applied. Using this heuristic, we show that in order to decrease the probability of a custome...