Stationary analysis of a fluid queue driven by some countable state space Markov chain (Q2475267): Difference between revisions

In the paper, a general algorithm for computing the stationary distribution and related characteristics of an infinite buffer fluid queue driven by a Markov chain with a countable state of space, while controlling the error, is presented. The precise algorithms to compute the stationary buffer level distribution for particular classes of Markov chains such as quasi birth and death processes and \(GI/M/1\) type Markov chains are described in details.