Stochastic performance bounds by state space reduction

DOI10.1016/S0166-5316(99)00026-7MaRDI QIDQ4779400zbMATH OpenWikidataFDO

Authors Nihal Pekergin

Publication date 24 June 2003

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-5316(99)00026-7

zbMATH Keywords

discrete-time Markov chains

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 1330062
• Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
• scientific article; zbMATH DE number 1946759
• An iterative bounding method for stochastic automata networks
• Refinable bounds for large Markov chains

Cited in

(9)

• Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks
• Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
• Stochastic bounds with a low rank decomposition
• Censoring Markov Chains and Stochastic Bounds
• Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach
• scientific article; zbMATH DE number 1330062 (Why is no real title available?)
• Transforming stochastic matrices for stochastic comparison with the st-order
• Computing the bounds on the loss rates
• An iterative bounding method for stochastic automata networks

This page was built for publication: Stochastic performance bounds by state space reduction

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