Analysis of tandem polling queues with finite buffers

2019 ◽  
Vol 293 (1) ◽  
pp. 343-369 ◽  
Author(s):  
Ravi Suman ◽  
Ananth Krishnamurthy
Keyword(s):  
Finite Buffers

Energy Efficiency Maximization Under Minimum Rate Constraints in Multi-Cell MIMO Systems with Finite Buffers

2020 ◽  
pp. 1-1
Author(s):  
Juno V. Saraiva ◽  
Roberto P. Antonioli ◽  
Gabor Fodor ◽  
Iran M. Braga ◽  
Walter C. Freitas ◽  
...  
Keyword(s):  
Energy Efficiency ◽  
Mimo Systems ◽  
Finite Buffers ◽  
Minimum Rate ◽  
Minimum Rate Constraints ◽  
Rate Constraints

Discontinuous Conservation Laws for Production Networks with Finite Buffers

2013 ◽  
Vol 73 (3) ◽  
pp. 1117-1138 ◽  
Author(s):  
Simone Göttlich ◽  
Axel Klar ◽  
Patrick Schindler
Keyword(s):  
Conservation Laws ◽  
Production Networks ◽  
Finite Buffers

scholarly journals A macroscopic traffic flow model with finite buffers on networks: well-posedness by means of Hamilton–Jacobi equations

2020 ◽  
Vol 18 (6) ◽  
pp. 1569-1604
Author(s):  
Nicolas Laurent-Brouty ◽  
Alexander Keimer ◽  
Paola Goatin ◽  
Alexandre M. Bayen
Keyword(s):  
Traffic Flow ◽  
Flow Model ◽  
Well Posedness ◽  
Finite Buffers ◽  
Traffic Flow Model ◽  
Macroscopic Traffic Flow ◽  
Jacobi Equations

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