Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T06:06:49.710Z Has data issue: false hasContentIssue false

Some comparability results for waiting times in single- and many-server queues

Published online by Cambridge University Press:  14 July 2016

D. J. Daley*
Affiliation:
The Australian National University
T. Rolski*
Affiliation:
Wrocław University
*
∗ Postal address: Statistics Department, IAS, The Australian National University, GPO Box 4, Canberra ACT 2601, Australia.
∗∗ Postal address: Mathematics Institute, Wrocław University, pl. Grunwaldski 2/4, 50-384 Wrocław, Poland.

Abstract

It is shown that the stationary waiting time random variables W′, W″ of two M/G/l queueing systems for which the corresponding service time random variables satisfy E(S ′−x)+ ≦ E(S ″−x)+ (all x >0), are stochastically ordered as W ′≦d W ″. The weaker conclusion, that E(W ′−x)+ ≦ E(W ″−x)+ (all x > 0), is shown to hold in GI/M/k systems when the interarrival time random variables satisfy E(x−T ′)+ ≦ E(x−T ″)+ (all x). A sufficient condition for wk ≡EW in GI/D/k to be monotonic in k for a sequence of k-server queues with the same relative traffic intensity is given. Evidence indicating or refuting possible strengthenings of some of the results is indicated.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1984 

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