Approximations for Superposition Arrival Processes in Queues

Published Online:https://doi.org/10.1287/mnsc.30.5.623

S. L. Albin has described extensive simulations of queue behavior for a system with a single server and an arrival process that is a superposition of n renewal processes. The simulations show, among other things, that as n increases for a fixed traffic intensity ρ, the queue behavior approaches that of the M/M/1 system. The rate of convergence, however, becomes much slower as the traffic intensity ρ comes closer to 1. Several qualitative effects shown in the simulations are explained here. In particular it is shown that the approach to the M/M/1 system requires that n(1 − ρ)2 ≫ 1.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.