Computing stationary expectations in level-dependent QBD processes

26Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Stationary expectations corresponding to long-run averages of additive functionals on level-dependent quasi-birth-and-death processes are considered. Special cases include long-run average costs or rewards, moments and cumulants of steady-state queueing network performance measures, and many others. We provide a matrix-analytic scheme for numerically computing such stationary expectations without explicitly computing the stationary distribution of the process, which yields an algorithm that is as quick as its counterparts for stationary distributions but requires far less computer storage. Specific problems arising in the case of infinite state spaces are discussed and the application of the algorithm is demonstrated by a queueing network example. © Applied Probability Trust 2013.

Cite

CITATION STYLE

APA

Baumann, H., & Sandmann, W. (2013). Computing stationary expectations in level-dependent QBD processes. Journal of Applied Probability, 50(1), 151–165. https://doi.org/10.1239/jap/1363784430

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free