On the complete monotonicity of the waiting time density in some GI/G/k systems (Q1107222)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4064214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complete monotonicity of the waiting time density in some GI/G/k systems |
scientific article; zbMATH DE number 4064214 |
Statements
On the complete monotonicity of the waiting time density in some GI/G/k systems (English)
0 references
1987
0 references
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.
0 references
completely monotone functions
0 references
monotonicity of the waiting time density
0 references
geometric compounding
0 references
0 references
0 references
0.7819133996963501
0 references
0.7742406725883484
0 references
0.7723769545555115
0 references
0.770128607749939
0 references
