Realization factors and perturbation analysis of open queueing networks

Xi Ren Cao*

*Corresponding author for this work

Research output: Contribution to journalConference article published in journalpeer-review

Abstract

The perturbation analysis of open queuing networks is discussed. The concept of realization probability is extended to realization factors for open networks. A set of linear equations is derived for realization factors. It is shown that the perturbation analysis estimate of the sensitivity of a performance measure with respect to a mean service rate (or a mean interarrival rate) converges with probability one to the sensitivity of the steady-state performance measure, which simply equals the expected value of the realization factor. The results provide an analytical method of calculating performance sensitivity and form a theoretical foundation for perturbation analysis of open networks.

Original languageEnglish
Pages (from-to)2006-2011
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume3
Publication statusPublished - 1989
Externally publishedYes
EventProceedings of the 28th IEEE Conference on Decision and Control. Part 2 (of 3) - Tampa, FL, USA
Duration: 13 Dec 198915 Dec 1989

Fingerprint

Dive into the research topics of 'Realization factors and perturbation analysis of open queueing networks'. Together they form a unique fingerprint.

Cite this