Abstract
Perturbation analysis (PA) applies a dynamic point of view to the sample paths of stochastic systems; the realization factor, one of the main concepts of PA, measures the final effect of a perturbation on system performance and provides a novel approach in obtaining performance sensitivities. In this paper, we solve analytically the set of equations for realization factors of a two-server cyclic network. We prove an invariance property of the performance sensitivity for Norton's aggregation. Using the results, we derive closed-form formulae for the derivatives of performance measures in a closed queueing network with load-dependent exponential servers. The performance measures have two general forms: customer average and time average. In contrast with the usual approach based on product-form solutions, our results provide additional insights into the performance sensitivity of closed queueing networks and have immediate applications to problems of optimal control. The general formulae are expressed in terms of Buzen's algorithm with a computational complexity comparable to that of the formulae obtained by directly taking the derivatives of the product-form solutions.
Similar content being viewed by others
References
F. Baskett, K.M. Chandy, R.R. Muntz, and F.G. Palacios, “Open, closed, and mixed networks of queues with different classes of customers,”J. ACM, Vol. 22, pp. 284–260, 1975.
J.P. Buzen, “Computational algorithm for closed queueing networks with exponential servers,”Comm. ACM, Vol. 16, pp. 527–531, 1973.
X.R. Cao, “Realization probability in closed Jackson queueing networks and its application,”Adv. Appl. Probab., Vol. 19, pp. 708–738, 1987.
X.R. Cao, “Realization factors and sensitivity of analysis of queueing networks with state-dependent service rates,”Adv. Appl. Prob., Vol. 22, pp. 178–210, 1990.
X.R. Cao and D.J. Ma, “Performance sensitivity formulas, algorithms and estimates for closed queueing networks with exponential servers,” Technical Report, Digital Equipment Corporation, June 1990.
X.R. Cao and D.J. Ma, “Sensitivity analysis of general performance measures of queueing networks with state-dependent service rates,”Appl. Math. Lett., Vol. 4, No. 4, pp. 57–60, 1991.
K.M. Chandy and A.J. Martin, “A characterization of product-form queueing networks,”J. ACM, Vol. 30, pp. 286–299, 1983.
K.M. Chandy, U. Herzog, and L. Woo, “Parametric analysis of queueing networks,”IBM J. Res. Dev., Vol. 19, pp. 36–42, 1975.
P. Glasserman, “The limiting value of derivative estimates based on perturbation analysis,”Comm. Statist.: Stochastic Models, Vol. 6, No. 2, pp. 229–257, 1990.
Y.C Ho and X.R Cao,Perturbation Analysis of Discrete Event Dynamic Systems, Kluwer: Boston, 1991.
L. Kleinrock,Queueing Systems, Vol. 1Theory, Wiley: New York, 1975.
D.J. Ma and X.R Cao, “Performance sensitivity formulas and optimal control of closed queueing networks,” Proc. 29th IEEE Conf. on Decision and Control, 1990, pp. 167–172.
N.J. Pullman,Matrix Theory and its Applications, Dekker: New York, 1976.
Y.C. Tay and R. Suri, “Error bounds for performance prediction in queueing networks,”ACM Trans. Comput. Syst., Vol. 3, pp. 227–254, 1985.
A.C. Williams and R.A. Bhandiwad, “A generating function approach to queueing network analysis of multiprogrammed computers,”Networks, Vol. 6, pp. 1–22, 1976.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cao, XR., Ma, DJ. New performance sensitivity formulae for a class of product-form queueing networks. Discrete Event Dyn Syst 1, 289–313 (1992). https://doi.org/10.1007/BF01796826
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01796826