Hostname: page-component-7479d7b7d-68ccn Total loading time: 0 Render date: 2024-07-09T20:56:08.135Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal buffer allocation in a two-stage queueing system

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

Panayotis D. Sparaggis  and
Wei-Bo Gong
Panayotis D. Sparaggis
Affiliation:
University of Massachusetts
Wei-Bo Gong*
Affiliation:
University of Massachusetts
*
∗ Postal address: Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003, USA.
Get access Rights & Permissions [Opens in a new window]

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.

Keywords

BLOCKINGBUFFER ALLOCATIONGENERALIZED SEMI-MARKOV PROCESS

MSC classification

Primary: 60K15: Markov renewal processes, semi-Markov processes
Type
Short Communications
Information
Journal of Applied Probability , Volume 30 , Issue 2 , June 1993 , pp. 478 - 482
Copyright
Copyright © Applied Probability Trust 1993 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Akyildiz, I. F. and Liu, W. (1989) Selecting capacities in cyclic networks of queues with finite buffers. Preprint, Georgia Tech. Google Scholar
[2] Anantharam, V. (1989) The optimal buffer allocation problem. IEEE Trans. Inform. Theory 35, 721–725.CrossRefGoogle Scholar
[3] Anantharam, V. and Tsoucas, P. (1990) Stochastic concavity of throughput in series of queues with finite buffers. Adv. Appl. Prob. 22, 761–763.CrossRefGoogle Scholar
[4] Dallery, Y., Liu, Z. and Towsley, D. (1990) Equivalence, reversibility and symmetry properties in fork/join queueing networks with blocking.Google Scholar
[5] Glasserman, P. and Yao, D. D. (1992) Monotonicity in generalized semi-Markov processes. Math. Operat. Res. 17, 1–21.CrossRefGoogle Scholar
[6] Glasserman, P. and Yao, D. D. (1991) Structured buffer-allocation problems in production lines. Preprint, Columbia University.Google Scholar
[7] Glynn, P. W. (1989) A GSMP formalism for discrete event systems. Proc. IEEE 77, 14–23.CrossRefGoogle Scholar
[8] Marshall, A. W. and Olkin, I. (1979) Inequalities: Theory of Majorization and its Applications. Academic Press, New York.Google Scholar
[9] Meester, L. and Shanthikumar, J. G. (1990) Concavity of the throughput in tandem queueing systems with finite buffer storage space. Adv. Appl. Prob. 22, 764–767.CrossRefGoogle Scholar