On the complete monotonicity of the waiting time density in some GI/G/k systems (Q1107222)

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.