Strong Approximations of Open Queueing Networks

Published Online:https://doi.org/10.1287/moor.17.2.487

We consider a queueing system with one or more stations. We show that the queue length processes can be approximated with Brownian motions or reflected Brownian motions. Using the approximations we obtain rates of convergence of the distributions and expected values of queue lengths.

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.