A graphical investigation of error bounds for moment-based queueing approximations (Q809486)

The problems studied in this paper are basically the same as in the paper reviewed above. Here three performance measures are considered: the probability of delay of an arriving customer and the mean queue length in a G/M/1-queue in steady state, and finally for a GI/M/n/n loss system the probability that an arriving customer is blocked. As all three parameters depend monotonically on the Laplace transform of the interarrival time distribution, there are close connections in the behavior of moment-based approximations for them.