Hostname: page-component-848d4c4894-p2v8j Total loading time: 0.001 Render date: 2024-05-21T00:12:18.376Z Has data issue: false hasContentIssue false

Stochastic monotonicity in general queueing networks

Published online by Cambridge University Press:  14 July 2016

J. George Shanthikumar*
Affiliation:
University of California, Berkeley
David D. Yao*
Affiliation:
Harvard University
*
Postal address: School of Business Administration, University of California, Berkeley, CA 94720, USA.
∗∗ Postal address: Division of Applied Sciences, Harvard University, Cambridge, MA 02138, USA.

Abstract

We develop a representation for general queueing networks, and study some stochastic monotonicity properties that have been previously established in Jackson networks (e.g. Shanthikumar and Yao (1986), (1987)).

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1989 

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

Adan, I. and Van Der Wal, J. (1987) Monotonicity of the Throughput of an Open Queueing Network in the Interarrival and Service Times. Memo COSOR 87–05, Faculty of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands.Google Scholar
Kamae, T., Krengel, U. and O'Brien, G. (1977) Stochastic inequalities on partially ordered spaces. Ann. Prob. 5, 899912.Google Scholar
Shanthikumar, J. G. and Yao, D. D. (1986) The effect of increasing service rates in closed queueing networks. J. Appl. Prob. 23, 474483.CrossRefGoogle Scholar
Shanthikumar, J. G. and Yao, D. D. (1987) Stochastic monotonicity of the queue lengths in closed queueing networks. Operat. Res. 35, 583588.Google Scholar
Shanthikumar, J. G. and Yao, D. D. (1988) Second-order properties of the throughput of a closed queueing network. Math. Operat. Res. 13, 524534.CrossRefGoogle Scholar