On the complete monotonicity of the waiting time density in some GI/G/k systems
From MaRDI portal
(Redirected from Publication:1107222)
The complete monotonicity of the waiting time density in GI/G/k queues is proved under the assumption that the service time density is completely monotone. This is an extension of \textit{J. Keilson}'s result for M/G/1 queues [J. Appl. Probab. 15, 162-170 (1978; Zbl 0386.60072)]. We also provide another proof of the result that complete monotonicity is preserved by geometric compounding.
Recommendations
- On the concavity of the waiting-time distribution in some GI/G/1 queues
- scientific article; zbMATH DE number 994723
- On the \(\mathrm{GI}/\mathrm{GI}/\infty\) and the \(\mathrm{GI}/\mathrm{GI}/c/c\) having completely monotone arrivals
- A note on properties of stationary waiting time distribution and its heavy traffic limit
- Some comparability results for waiting times in single- and many-server queues
Cites work
- Exponential spectra as a tool for the study of server-systems with several classes of customers
- scientific article; zbMATH DE number 3359452 (Why is no real title available?)
- On the continuity of G/GI/m queues
- The queue GI/M/s with customers of different types or the queue GI/Hm/s
- What is the Laplace Transform?
Cited in
(2)
This page was built for publication: On the complete monotonicity of the waiting time density in some GI/G/k systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107222)
