scholarly journals Solving the buffer allocation problem using simulation-based optimisation

ORiON ◽  
2021 ◽  
Vol 36 (2) ◽  
Author(s):  
JW Joubert ◽  
DJ Kotze
2012 ◽  
Vol 25 (3) ◽  
pp. 371-392 ◽  
Author(s):  
Leyla Demir ◽  
Semra Tunali ◽  
Deniz Tursel Eliiyi

2019 ◽  
Vol 58 (22) ◽  
pp. 6846-6867 ◽  
Author(s):  
Shaohui Xi ◽  
Qingxin Chen ◽  
James MacGregor Smith ◽  
Ning Mao ◽  
Ailin Yu ◽  
...  

2015 ◽  
Vol 54 (11) ◽  
pp. 3243-3255 ◽  
Author(s):  
Lei Li ◽  
YanLing Qian ◽  
Yong Min Yang ◽  
Kai Du

1993 ◽  
Vol 30 (02) ◽  
pp. 478-482
Author(s):  
Panayotis D. Sparaggis ◽  
Wei-Bo Gong

We study the buffer allocation problem in a two-stage cyclic queueing system. First, we show that transposing the number of buffers assigned to each queue does not affect the throughput. Second, we prove that the optimal buffer allocation scheme, in the sense of maximizing the system's throughput, is the one for which the absolute difference between the number of buffers, assigned to each queue, is minimized, i.e., it becomes either 0 or 1. This optimal allocation is insensitive to the general-type service-time distributions. These two distributions may be different and service times may even be correlated.


Sign in / Sign up

Export Citation Format

Share Document