Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T01:48:22.849Z Has data issue: false hasContentIssue false

Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers

Published online by Cambridge University Press:  01 July 2016

David Sonderman*
Affiliation:
Yale University
*
∗ Postal address: Box 1070, New Haven, CT 06504, U.S.A.

Abstract

We compare two queueing systems with identical general arrival streams, but different numbers of servers, different waiting room capacities, and stochastically ordered service time distributions. Under appropriate conditions, it is possible to construct two new systems on the same probability space so that the new systems are probabilistically equivalent to the original systems and each sample path of the stochastic process representing system size in one system lies entirely below the corresponding sample path in the other system. This construction implies stochastic order for these processes and many associated quantities of interest, such as a busy period, the number of customers lost in any interval, and the virtual waiting time.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1979 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable