Strong truncation approximation in tandem queues with blocking
From MaRDI portal
Recommendations
- An Approximation Method for Tandem Queues with Blocking
- Approximation of throughput in tandem queues with multiple servers and blocking
- An approximate analysis of tandem queues with general blocking nodes
- A Common Model for the Approximate Analysis of Tandem Queueing Systems With Blocking
- New bounds for expected cycle times in tandem queues with blocking
- Tandem queues with general blocking: A unified model and comparison results
- Diffusion approximation for a tandem queue with blocking
- On Decomposition Methods for Tandem Queueing Networks with Blocking
- scientific article; zbMATH DE number 1301681
Cites work
- scientific article; zbMATH DE number 3839076 (Why is no real title available?)
- scientific article; zbMATH DE number 3789619 (Why is no real title available?)
- scientific article; zbMATH DE number 1337345 (Why is no real title available?)
- scientific article; zbMATH DE number 3284853 (Why is no real title available?)
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- An explicit solution for a tandem queue with retrials and losses
- Approximate analysis of exponential queueing systems with blocking
- Approximating the stationary distribution of an infinite stochastic matrix
- Approximation of the invariant probability measure of an infinite stochastic matrix
- Augmented truncations of infinite stochastic matrices
- Comparison of perturbation bounds for the stationary distribution of a Markov chain
- Computation of Steady-State Probabilities for Infinite-State Markov Chains with Repeating Rows
- Digraph-based conditioning for Markov chains
- Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
- Error bounds for state space truncation of finite Jackson networks
- Estimates for the deviations of the transition characteristics of nonhomogeneous Markov processes
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- Improved bounds for a condition number for Markov chains
- Monotone infinite stochastic matrices and their augmented truncations
- On a question concerning condition numbers for Markov chains
- Queueing Networks and Markov Chains
- SERIES EXPANSIONS FOR FINITE-STATE MARKOV CHAINS
- Sensitivity and convergence of uniformly ergodic Markov chains
- Series expansions for continuous-time Markov processes
- Strongly stable Markov chains
- Structural Perturbation Analysis of a Single Server Queue with Breakdowns
- Taylor series expansions for stationary Markov chains
- The problem of stability in queueing theory
- Truncation of Markov Chains with Applications to Queueing
This page was built for publication: Strong truncation approximation in tandem queues with blocking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955334)
