Monotonicity of throughput in non-Markovian networks
- 1 March 1989
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 26 (1) , 134-141
- https://doi.org/10.2307/3214323
Abstract
Monotonicity of throughput is established in some non-Markovian queueing networks by means of pathwise comparisons. In a series of · /GI/s/N queues with loss at the first node it is proved that increasing the waiting room and/or the number of servers increases the throughput. For a closed network of · /GI/s queues it is shown that the throughput increases as the total number of jobs increases. The technique used for these results does not apply to blocking systems with finite buffers and feedback. Using a stronger coupling argument we prove throughput monotonicity as a function of buffer size for a series of two ·/M/1/N queues with loss and feedback from the second to the first node.Keywords
This publication has 4 references indexed in Scilit:
- Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay SystemsProbability in the Engineering and Informational Sciences, 1988
- The effect of increasing service rates in a closed queueing networkJournal of Applied Probability, 1986
- A Note On Transfer Lines With Unreliable Machines, Random Processing Times, and Finite BuffersIIE Transactions, 1982
- An upper bound for multi-channel queuesJournal of Applied Probability, 1977