Skip to main content
SpringerLink
Log in

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

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. Billingsley,Probability and Measure (Wiley, 1979).

  2. A.A. Borovkov,Stochastic Processes in Queueing Theory (Springer, 1976).

  3. A.A. Borovkov, Ergodicity and stability theorems for a class of stochastic equations and their application, Theory Prob. Appl. 23 (1978) 227–247.

    Google Scholar 

  4. A.A. Borovkov, Limit theorems for queueing networks, I, Theory Prob. Appl. 31 (1987).

  5. X.R. Cao, Realization probability in closed Jackson queueing networks and its application, Advan. Appl. Prob. 19 (1987) 708–738.

    Google Scholar 

  6. X.R. Cao, First-order perturbation analysis of a single multi-class finite source queue, Perform. Eval. 7 (1987) 31–41.

    Google Scholar 

  7. X.R. Cao, A sample performance function of Jackson queueing networks, Oper. Res.1 36 (1988) 128–136.

    Google Scholar 

  8. X.R. Cao, A comparison of the dynamics of continuous and discrete event systems, IEEE Proc. 77 (1989) 7–13.

    Google Scholar 

  9. X.R. Cao and D.J. Ma, Sensitivity analysis of general performance measures of queueing networks with state dependent service rates, Appl. Math. Lett. 4 (1991) 57–60.

    Google Scholar 

  10. C. Cassandras and S. Strickland, Observable augmented system for sensitivity analysis of Markov and semi-Markov processes, IEEE Trans. Auto. Control AC-34 (1989) 1026–1037.

    Google Scholar 

  11. K.M. Chandy, J.H. Howard Jr., and D.F. Towsley, Product form and load balance in queueing networks, J. ACM 24 (1977) 250–263.

    Google Scholar 

  12. E. Çinlar,Introduction to Stochastic Processes (Prentice Hall, 1975).

  13. P. Glasserman, On the limiting values of perturbation analysis derivative estimators, Stoch. Mod. 6 (1990) 229–257.

    Google Scholar 

  14. P. Glasserman, Structural conditions for perturbation analysis derivative estimation: finite time performance indices, submitted (1988).

  15. P. Heidelberger, X.R. Cao, M.A. Zazanis and R. Suri, Convergence properties of infinitesimal perturbation analysis estimates, Manag. Sci. 34 (1988) 1281–1302.

    Google Scholar 

  16. W.B. Gong and Y.C. Ho, Smoothed (conditional) perturbation analysis of discrete event dynamic systems, IEEE Trans. Auto. Control AC-32 (1987) 858–866.

    Google Scholar 

  17. Y.C. Ho, Discrete event dynamics systems and perturbation analysis — perspectives and open problems, IEEE Trans. Auto. Control AC-32 (1987) 563–572.

    Google Scholar 

  18. Y.C. Ho (ed.),Special Issue on Dynamics of Discrete Event Systems, Proc. IEEE (January 1989).

  19. Y.C. Ho and S. Li, Extensions of infinitesimal perturbation analysis, IEEE Trans. Auto. Control AC-33 (1988) 427–438.

    Google Scholar 

  20. G. Shanthikumar and D.D. Yao, General queueing networks: representation and stochastic monotonicity,Proc. 26th IEEE Conf. on Decision and Control (1987) pp. 1084–1087.

  21. K. Sigman, Notes on the stability of closed queueing networks, J. Appl. Prob. 26 (1989) 678–681.

    Google Scholar 

  22. K. Sigman, The stability of open queueing networks, Stoch. Proc. Appl., (1990) to appear.

  23. R. Suri, Perturbation analysis, The state of the art and research issues explained via the GI/G/1 queue, Proc. IEEE (1989) 114–137.

  24. W. Whitt, Continuity of generalized semi-Markov processes, Math. Oper. Res. 5 (1980).

Download references

Author information

Authors and Affiliations

  1. Digital Equipment Corporation, MRO1-2/S10, 200 Forest Street, 01752, Marlboro, MA, USA

    Xi-Ren Cao

Authors
  1. Xi-Ren Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cao, XR. A new method of performance sensitivity analysis for non-Markovian queueing networks. Queueing Syst 10, 313–350 (1992). https://doi.org/10.1007/BF01193325

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01193325

Keywords

Search

Navigation