Computational analysis of single-server bulk-arrival queues \(M^ X/G/1\) (Q1100086)

This paper studies numerically the bulk-arrival queueing model \(M^ x/G/1\). For a special service-time distribution, an algorithm for the limiting distribution of the number in the system at random epoch is developed. This is also used to find the limiting distribution of the number in the system at pre-arrival and post-departure epochs. The mean and standard deviation of these distributions are also computed. Four cases of the service-time distribution are discussed: hyperexponential, deterministic, uniform and Erlang.