Discrete Time Retrial Queueing Model With Vacation

This monograph provides some discrete time vacation queues and retrial queues with a bulk service rule. The arrival pattern follows geometric distribution and the service time is generally distributed with a single server. The arriving packets receive batch service in the first phase followed by individual service in the second phase. Further, for an M/M/1 retrial queueing model with Bernoulli verification law, Steady state condition, joint distribution of busy server and number of customers present in the orbit at a random epoch has been determined and illustrated. An optimization problem is provided to support the results. Using probability generating function (p.g.f) approach, the analysis has been carried out under the usual assumptions of queueing theory.