Estimating the sojourn time sensitivity in queueing networks using perturbation analysis

X. R. Cao*, Y. C. Ho

*Corresponding author for this work

Research output: Contribution to journalJournal Articlepeer-review

11 Citations (Scopus)

Abstract

The sample path perturbation analysis technique developed earlier for the analysis of throughput sensitivities (Refs. 1-3) is extended to the performance measures involving mean sojourn times of customers. The major features of the sojourn time sensitivity problem are twofold. Firstly, it is a performance associated with servers, and not with customers. Secondly, the average sojourn time in any finite observation period can be a discontinuous function of mean service times when blocking is involved in a system. This discontinuity causes errors which must be accounted for in the estimation of sensitivities. Numerical experiments and analysis validate this method of computation of the sensitivities.

Original languageEnglish
Pages (from-to)353-375
Number of pages23
JournalJournal of Optimization Theory and Applications
Volume53
Issue number3
DOIs
Publication statusPublished - Jun 1987
Externally publishedYes

Keywords

  • General queueing networks
  • discrete event dynamic systems
  • sensitivity analysis

Fingerprint

Dive into the research topics of 'Estimating the sojourn time sensitivity in queueing networks using perturbation analysis'. Together they form a unique fingerprint.

Cite this