Efficient and reliable computation of birth-death process performance measures
From MaRDI portal
Recommendations
- Fast algorithmic solutions to multi-dimensinal birth-death processes with applications to telecommunication systems
- Computation of Derivatives by Means of the Power-Series Algorithm
- Uniform algorithm for transient solutions of generalized quasi-birth-death processes
- Upper bound on the rate of convergence and truncation bound for non-homogeneous birth and death processes on \(\mathbb{Z} \)
- A computational approach for fluid queues driven by truncated birth-death processes
Cites work
- A formula for tail probabilities of Cox distributions
- Bounds on tail probabilities of discrete distributions
- Calculation of steady-state probabilities of M/M queues: Further approaches
- Engineering solution of a basic call-center model
- Markov chain models of a telephone call center with call blending
- Some Properties of the Erlang Loss Function
- Stochastic monotonicity of birth–death processes
- The Classification of Birth and Death Processes
Cited in
(6)- Modeling load and overwork effects in queueing systems with adaptive service rates
- scientific article; zbMATH DE number 3843025 (Why is no real title available?)
- Further approaches to computing fundamental characteristics of birth-death processes
- Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes
- Fast algorithmic solutions to multi-dimensinal birth-death processes with applications to telecommunication systems
- Inhomogeneous CTMC birth-and-death models solved by uniformization with steady-state detection
This page was built for publication: Efficient and reliable computation of birth-death process performance measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815427)
