Error bounds and comparison results: the Markov reward approach for queueing networks
From MaRDI portal
Publication:2997684
Recommendations
- Bounds and error bounds for queueing networks
- Transient error bound analysis for continuous-time Markov reward structures
- A linear programming approach to Markov reward error bounds for queueing networks
- Analytic error bounds for approximations of queueing networks with an application to alternate routing
- Perturbation theory for Markov reward processes with applications to queueing systems
Cited in
(12)- Differentiation via logarithmic expansions
- On truncations and perturbations of Markov decision problems with an application to queueing network overflow control
- Analytic error bounds for approximations of queueing networks with an application to alternate routing
- Perturbation theory for Markov reward processes with applications to queueing systems
- A graphical investigation of error bounds for moment-based queueing approximations
- A linear programming approach to Markov reward error bounds for queueing networks
- Erlang loss bounds for OT-ICU systems
- Error bounds for augmented truncation approximations of Markov chains via the perturbation method
- PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS
- Invariant measures and error bounds for random walks in the quarter-plane based on sums of geometric terms
- The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures
- A linear programming approach to error bounds for random walks in the quarter-plane.
This page was built for publication: Error bounds and comparison results: the Markov reward approach for queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997684)