scientific article; zbMATH DE number 19257

MaRDI QIDQ3976692zbMATH OpenFDO

Authors Nico M. van Dijk

Publication date 26 June 1992

zbMATH Keywords

comparison resultsMarkov reward structuresperturbationstruncations

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Review text

[For the entire collection see Zbl 0733.00019.] The author presents a tool for bounding the so-called bias terms (or fundamental matrices) for Markov reward structures theory. The main idea is to use an inductive Markov reward technique. As a consequence, error bounds, or comparison results can be obtained for various type of ``approximate modelling (e.g., perturbations, truncations, modification, comparisons).

Recommendations

• Transient error bound analysis for continuous-time Markov reward structures
• Bounding reward measures of Markov models using the Markov decision processes.
• Error bounds for nonnegative dynamic models
• Bounds and error bounds for queueing networks

Cited in

(6)

• A note on monotonicity results in multicasting
• On product form approximations for communication networks with losses: Error bounds
• Error bounds for nonnegative dynamic models
• Performance bounds for modeling NUMA architectures
• Monotonicity and error bounds for networks of Erlang loss queues
• Sub-stochastic matrix analysis for bounds computation -- theoretical results

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 Q3976692)