Realization factors and sensitivity analysis of queueing networks with state-dependent service rates

The paper studies the sensitivity of the throughput with respect to a mean service rate in a closed queueing network with exponentially distributed service requirements and state-dependent service rates. The study is based on perturbation analysis of queueing networks. A new concept, the realization factor of a perturbation, is introduced. The properties of realization factors are discussed, and a set of equations specifying the realization factors are derived. The elasticity of the steady state throughput with respect to a mean service rate equals the product of the steady state probability and the corresponding realization factor. This elasticity can be estimated by applying a perturbation analysis algorithm to a sample path of the system. The sample path elasticity of the throughput with respect to a mean service rate converges with probability 1 to the elasticity of the steady state throughput. The theory provides an analytical method of calculating the throughput sensitivity and justifies the application of perturbation analysis.

[1]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[2]  Erhan Çinlar,et al.  Introduction to stochastic processes , 1974 .

[3]  K. Mani Chandy,et al.  Parametric Analysis of Queuing Networks , 1975, IBM J. Res. Dev..

[4]  N. Pullman Matrix theory and its applications , 1976 .

[5]  P. Billingsley,et al.  Probability and Measure , 1980 .

[6]  Christos G. Cassandras,et al.  Infinitesimal and finite perturbation analysis for queueing networks , 1982, 1982 21st IEEE Conference on Decision and Control.

[7]  Xi-Ren Cao,et al.  Perturbation analysis and optimization of queueing networks , 1983 .

[8]  Xi-Ren Cao Convergence of parameter sensitivity estimates in a stochastic experiment , 1984, The 23rd IEEE Conference on Decision and Control.

[9]  L. Ljung Asymptotic variance expressions for identified black-box transfer function models , 1985, The 23rd IEEE Conference on Decision and Control.

[10]  Y C Ho,et al.  Equivalent network, load dependent servers, and perturbation analysis—an experimental study , 1986 .

[11]  X. Cao Realization probability in closed Jackson queueing networks and its application , 1987, Advances in Applied Probability.

[12]  Y. Ho,et al.  Smoothed (conditional) perturbation analysis of discrete event dynamical systems , 1987 .

[13]  Rajan Suri,et al.  Infinitesimal perturbation analysis for general discrete event systems , 1987, JACM.

[14]  Xi-Ren Cao,et al.  First-Order Perturbation Analysis of a Simple Multi-Class Finite Source Queue , 1987, Perform. Evaluation.

[15]  Yu-Chi Ho,et al.  Sensitivity analysis and optimization of throughput in a production line with blocking , 1987 .

[16]  Xi-Ren Cao,et al.  A Sample Performance Function of Closed Jackson Queueing Networks , 1988, Oper. Res..

[17]  Xi-Ren Cao Realization probability in multi-class closed queuing networks , 1988 .

[18]  Y. Ho,et al.  Extensions of infinitesimal perturbation analysis , 1988 .

[19]  Xi-Ren Cao,et al.  The convergence property of sample derivatives in closed Jackson queuing networks , 1989 .

[20]  Xi-Ren Cao Calculation of sensitivities of throughputs and realization probabilities in closed queueing networks with finite buffer capacities , 1989, Advances in Applied Probability.

[21]  Paul Glasserman,et al.  Aggregation Approximations for Sensitivity Analysis of Multi-Class Queueing Networks , 1989, Perform. Evaluation.

[22]  R. Suri,et al.  Perturbation analysis: the state of the art and research issues explained via the GI/G/1 queue , 1989, Proc. IEEE.