PALM-MARTINGALE CALCULUS, QUEUES WITH VACATIONS, BATCH MARKOVIAN ARRIVAL PROCESSES,SERVER SET-UP Using Palm-martingale calculus, we derive the workload characteristic function and queue length moment generating function for the BMAP IGl/1 . queue with server vacations. In the queueing system under study, the server may start a vacation at the completion of a service or at the arrival of a custo...

A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.  

This paper presents a model for a discrete time single server G-queue with two types of independent arrivals, namely positive and negative. The arrival of negative customer to queueing system removes one customer from the head of the queue (RCH), which causes server breakdown. The repair of the server is noninstantaneous and after repair server is assumed as good as new. The interarrival times ...

In this paper we consider M[X]/G(a, b)/1 queueing system with accessible service, server breakdown without interruption, multiple vacation and closedown time. The service rule is as follows: the server starts service only when a minimum number of customers ′a′ is available in the queue and the maximum service capacity is ′b′ units such that late entries are allowed to join a service batch, with...

Polling models are used as an analytical performance tool in several application areas. In these models, the focus often is on controlling the operation of the server as to optimize some performance measure. For several applications, controlling the server is not an issue as the server moves independently in the system. We present the analysis for such a polling model with a so-called autonomou...

Consider two M=G=1 queues that are coupled in the following way. Whenever both queues are non-empty, each server serves its own queue at unit speed. However, if server 2 has no work in its own queue, then it assists server 1, resulting in an increased service speed r 1 1 in the first queue. This kind of coupling is related to generalized processor sharing. We assume that the service request dis...

We consider a tandem queue with two stations. The first station is an s-server queue with Poisson arrivals and exponential service times. After terminating his service in the first station, a customer enters the second station to require service at an exponential single server, while in the meantime he is blocking his server in station 1 until he completes service in station 2, whereupon the se...

WHY QUEUING ANALYSIS? ......................................................................................2 QUEUING MODELS......................................................................................................3 The Single-Server Queue.....................................................................................3 Queue Parameters .............................................