Strong truncation approximation in tandem queues with blocking

DOI10.1155/2012/906486zbMath1264.90050OpenAlexW2132012447WikidataQ58912647 ScholiaQ58912647MaRDI QIDQ1955334

Karima Adel-Aissanou, Karim Abbas, Djamil Aissani

Publication date: 11 June 2013

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/906486

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimates for the deviations of the transition characteristics of nonhomogeneous Markov processes
• Strongly stable Markov chains
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Monotone infinite stochastic matrices and their augmented truncations
• The problem of stability in queueing theory
• Approximate analysis of exponential queueing systems with blocking
• Improved bounds for a condition number for Markov chains
• Digraph-based conditioning for Markov chains
• An explicit solution for a tandem queue with retrials and losses
• Error bounds for state space truncation of finite Jackson networks
• On a Question Concerning Condition Numbers for Markov Chains
• Series Expansions for Continuous-Time Markov Processes
• Structural Perturbation Analysis of a Single Server Queue with Breakdowns
• Augmented truncations of infinite stochastic matrices
• Approximation of the invariant probability measure of an infinite stochastic matrix
• Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
• Truncation of Markov Chains with Applications to Queueing
• Computation of Steady-State Probabilities for Infinite-State Markov Chains with Repeating Rows
• Taylor series expansions for stationary Markov chains
• SERIES EXPANSIONS FOR FINITE-STATE MARKOV CHAINS
• Sensitivity and convergence of uniformly ergodic Markov chains
• Queueing Networks and Markov Chains
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
• Approximating the stationary distribution of an infinite stochastic matrix
• Comparison of perturbation bounds for the stationary distribution of a Markov chain

This page was built for publication: Strong truncation approximation in tandem queues with blocking