Hostname: page-component-7dd5485656-k8lnt Total loading time: 0 Render date: 2025-10-31T12:31:42.635Z Has data issue: false hasContentIssue false
  • English
  • Français

Stochastic concavity of throughput in series of queues with finite buffers

Published online by Cambridge University Press:  01 July 2016

Venkat Anantharam  and
Pantelis Tsoucas
Venkat Anantharam*
Affiliation:
Cornell University
Pantelis Tsoucas*
Affiliation:
IBM Research Division
*
∗Postal address: School of Electrical Engineering, Cornell University, Ithaca, NY 14853, USA.
∗∗Postal address: IBM Research Division, P.O. Box 704, Yorktown Heights, NY 10598, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Stochastic concavity of the output process with respect to buffer sizes is established in a series of ·/M/1/B queues with loss at the first node.

Keywords

BLOCKINGFINITE CAPACITY QUEUESMONOTONICITY

Information

Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 22 , Issue 3 , September 1990 , pp. 761 - 763
Copyright
Copyright © Applied Probability Trust 1990 

References

[1] Anantharam, V. and Tsoucas, P. (1989) Concavity of throughput in series of queues with finite buffers. SRC Tech. Rep. # 89–30, University of Maryland, College Park.Google Scholar
[2] Meester, L. E. and Shantikumar, J. G. (1990) Concavity of the throughput tandem queueing systems with finite buffer storage space. Adv. Appl. Prob. 22, 764–767.Google Scholar
[3] Shanthikumar, J. G. and Yao, D. D. (1989) Second-order stochastic properties in queueing systems. Proc. IEEE 77, 162–170 CrossRefGoogle Scholar
[4] Tsoucas, P. and Walrand, J. (1989) Monotonicity of throughput in non-Markovian networks. J. Appl. Prob. 26, 134–141.CrossRefGoogle Scholar