- Mean sojourn time in a parallel queue
- Volume | Issue number
- 17 | 64
- Pages (from-to)
- Document type
- Faculty of Economics and Business (FEB)
- Amsterdam School of Economics Research Institute (ASE-RI)
This account considers a parallel queue, which is two-queue network, where any arrival
generates a job at both queues. It is noted that earlier work has revealed that this class of
models is notoriously hard to analyze. We first evaluate a number of bounds developed in the literature, and observe that under fairly broad circumstances these can be rather inaccurate. For the 'homogeneous' case we present a number of approximations, which are extensively tested by simulation, and turn out to perform remarkably well.
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.