Counterexamples for comparisons of queues with finite waiting rooms (Q1183688)

In a queueing system with finite waiting room it seems plausible that the mean queue length and the throughput increase with increasing size of the waiting room. In this paper examples are given, where for a given size \(k\) of the waiting room the mean queue size equals \(k\) and the throughput almost equals the input rate. Increasing the size of the waiting room to \(m>k\) has the effect, that the mean queue length and the throughput drop down to quantities arbitrarily small. Of course the service times are not i.i.d.