A Variable Buffer-Size Model and Its Use in Analyzing Closed Queueing Networks with Blocking

1986 ◽  
Vol 32 (2) ◽  
pp. 206-224 ◽  
Author(s):  
Rajan Suri ◽  
Gregory W. Diehl
Keyword(s):  
Queueing Networks ◽  
Buffer Size ◽  
Closed Queueing Networks ◽  
Size Model

Optimal routing for closed queueing networks

1991 ◽  
Vol 13 (1) ◽  
pp. 3-15 ◽  
Author(s):  
William C. Cheng ◽  
Richard R. Muntz
Keyword(s):  
Queueing Networks ◽  
Optimal Routing ◽  
Closed Queueing Networks

scholarly journals Monotonicity of throughput in non-Markovian networks

1989 ◽  
Vol 26 (01) ◽  
pp. 134-141 ◽  
Author(s):  
Pantelis Tsoucas ◽  
Jean Walrand
Keyword(s):  
Queueing Networks ◽  
Buffer Size ◽  
Waiting Room ◽  
Finite Buffers ◽  
Closed Network ◽  
Markovian Queueing Networks

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.

Sign in / Sign up

Export Citation Format

Share Document