scientific article; zbMATH DE number 19242

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Review text

[For the entire collection see Zbl 0733.00019.] The authors consider the problem of computing conditional steady-state distributions in large Markovian queueing networks. They give a constructive proof that the so-called short-cut method gives exact results under conditions of local balance. They also introduce a more general decomposition method that gives exact conditional distribution under the weaker conditions of ``subsystem balance. Finally they analyze the accuracy of both methods under general conditions.

Recommendations

Cited in

(5)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976675)