A new method of performance sensitivity analysis for non-Markovian queueing networks

The paper develops a new method of calculating and estimating the sensitivities of a class of performance measures with respect to a parameter of the service or interarrival time distributions in queueing networks. The distribution functions may be of a general form. The study is based on perturbation analysis of queueing networks. A new concept, the realization factor of a perturbation, is introduced for the network studied. The properties of realization factors are discussed, and a set of linear differential equations specifying the realization factors are derived. The sensitivity of the steady-state performance with respect to a parameter can be expressed in a simple form using realization factors. Based on this, the sensitivity can be estimated by applying a perturbation analysis algorithm to a sample path of the system. We show that the derivative of the performance measure with respect to a parameter based on a single sample path converges with probability one to the derivative of the steady-state performance as the length of the sample path goes to infinity. The results provide a new analytical method of calculating performance sensitivities and justifies the application of perturbation analysis algorithms to non-Markovian queueing networks.

[1]  Aleksandr Alekseevich Borovkov,et al.  Stochastic processes in queueing theory , 1976 .

[2]  Donald F. Towsley,et al.  Product Form and Local Balance in Queueing Networks , 1977, JACM.

[3]  A. Borovkov.  Ergodicity and Stability Theorems for a Class of Stochastic Equations and Their Applications , 1979 .

[4]  Ward Whitt,et al.  Continuity of Generalized Semi-Markov Processes , 1980, Math. Oper. Res..

[5]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

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

[7]  J. Shanthikumar,et al.  General queueing networks: Representation and stochastic monotonicity , 1987, 26th IEEE Conference on Decision and Control.

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

[9]  Yu-Chi Ho,et al.  Performance evaluation and perturbation analysis of discrete event dynamic systems , 1987 .

[10]  A. Borovkov.  Limit Theorems for Queueing Networks. I , 1987 .

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

[12]  Xi-Ren Cao,et al.  Convergence properties of infinitesimal perturbation analysis , 1988 .

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

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

[15]  C. Cassandras,et al.  Observable augmented systems for sensitivity analysis of Markov and semi-Markov processes , 1989 .

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

[17]  K. Sigman.  NOTES ON THE STABILITY OF CLOSED QUEUEING NETWORKS , 1989 .

[18]  Xi-Ren Cao.  A comparison of the dynamics of continuous and discrete event systems , 1989, Proc. IEEE.

[19]  K. Sigman.  The stability of open queueing networks , 1990 .

[20]  P. Glasserman.  The limiting value of derivative estimators based on perturbation analysis , 1990 .

[21]  Paul Glasserman,et al.  Structural Conditions for Perturbation Analysis Derivative Estimation: Finite-Time Performance Indices , 1991, Oper. Res..

[22]  Xi-Ren Cao,et al.  Sensitivity analysis of general performance measures of queueing networks with state-dependent service rates , 1991 .