Hostname: page-component-cb9f654ff-c75p9 Total loading time: 0 Render date: 2025-08-24T08:28:23.470Z Has data issue: false hasContentIssue false
  • English
  • Français

Realization probability and throughput sensitivity in a closed jackson network

Published online by Cambridge University Press:  14 July 2016

Xi-Ren Cao
Xi-Ren Cao*
Affiliation:
Digital Equipment Corporation
*
∗ Postal address: Digital Equipment Corporation, MRO1–1/L26, 200 Forest Street, Marlboro, MA 01752, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Realization probability is a new concept pertaining to perturbation analysis of closed queuing networks. The sensitivities of throughputs in a closed single-class Jackson network can be expressed in terms of realization probabilities. In this paper, based on a discussion of perturbation analysis for networks with state-dependent service rates, we derive some new formulas for sensitivities of throughputs using realization probability.

Keywords

PERTURBATION ANALYSISCLOSED QUEUING NETWORKS

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 26 , Issue 3 , September 1989 , pp. 615 - 624
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.)

Article purchase

Temporarily unavailable

Footnotes

This work was initiated when the author was with the Division of Applied Sciences, Harvard University, Cambridge, MA 02138.

References

Cao, X. R. (1987) Realization probability in closed Jackson queuing networks and its application. Adv. Appl. Prob. 19, 708–738.Google Scholar
Cao, X. R. (1988a) On a sample performance function of closed Jackson networks. Operat. Res. 36, 128–136.Google Scholar
Cao, X. R. (1988b) Realization probability in multi-class closed queuing networks. European J. Operat. Res. 36, 393–401.Google Scholar
Ho, Y. C. and Cao, X. R. (1983) Perturbation analysis and optimization of queueing networks. J. Optim. Theory Applic. 40, 559–582.Google Scholar
Ho, Y. C. and Yang, P. Q. (1986) Equivalent network, load dependent servers and perturbation analysis — an experimental study. In Teletraffic Analysis and Computer Performance Evaluation, eds. Boxma, O. J., Cohen, J. W. and Tijms, H. C., North-Holland, Amsterdam.Google Scholar
Suri, R. (1983) Robustness of queuing network formulas. J. Assoc. Comput. Mach. 30, 564–594.Google Scholar