In:
Journal of Applied Probability, Cambridge University Press (CUP), Vol. 30, No. 02 ( 1993-06), p. 478-482
Abstract:
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.
Type of Medium:
Online Resource
ISSN:
0021-9002
,
1475-6072
DOI:
10.1017/S0021900200117504
Language:
English
Publisher:
Cambridge University Press (CUP)
Publication Date:
1993
detail.hit.zdb_id:
1474599-9
detail.hit.zdb_id:
219147-7
SSG:
3,2
Permalink