The truncated Hyper-Poisson queues: Hk/Ma,b/C/N with balking, reneging and general bulk service rule

The aim of this paper is to derive the analytical solution of the queue: Hk/Ma,b/C/N with balking and reneging in which (I) units arrive according to a hyper-Poisson distribution with k independent branches, (II) the queue discipline is FIFO; and (III) the units are served in batches according to a general bulk service rule. The steady-state probabilities, recurrence relations connecting various probabilities introduced are found and the expected number of units in the queue is derived in an explicit form. Also, some special cases are obtained. .

A preemptive priority queue with a general bulk service rule

In this paper a single server preemptive priority queueing system, consisting of two types of units, with unlimited Poisson inputs and exponential service time distributions, is studied. The higher priority units are served in batches according to a general bulk service rule and they have preemptive priority over lower priority units. Steady state queue length distributions, stability condition and the mean queue lengths are obtained.