Explicit and Iterative Numerical Approaches to Solving Queueing Models
This paper considers two approaches to the numerical solution of single node queueing models. Both approaches use a phase-type distribution to model very general service processes. The first approach is explicit and sometimes can exploit the structure of certain balance equations to reduce the global balance equations from a set of second order difference equations to a set of first order difference equations. This reduction permits the steady-state probability distribution to be written explicitly as a function of the model parameters. The second approach, due to Neuts, uses the fact that most queues that have a matrix-geometric steady-state probability distribution can be solved by means of a recursive technique. We compare the approaches and present a theorem that specifies necessary conditions for the computation of an explicit solution. Some examples are provided.
- Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments)
- A queueing model for a nonreliable multiterminal system with polling scheduling
- Two finite-difference methods for solving MAP(t)/PH(t)/1/K queueing models
- Numerical methods to analyses of queuing systems with instantaneous feedback, positive server setup time and impatient calls
- Componentwise accurate fluid queue computations using doubling algorithms
- A queueing model for a non-homogeneous terminal system subject to BR992
- Numerical algorithms for evaluating the traffic coefficient in generalized queueing systems
- scientific article; zbMATH DE number 3936891 (Why is no real title available?)
- Explicit Solutions of M/G/C/ /N-type Queueing Loops with Generalizations
- scientific article; zbMATH DE number 1031390 (Why is no real title available?)
- A graph-theoretic approach to queueing analysis part i: theory
- A graph-theoretic approach to queueing analysis part i: theory
- Numerical analysis of queues with batch arrivals
- A Comparison of Alternative Approaches for Numerical Solutions of GI/PH/1 Queues
- Conjugate gradient method approach to queue theory
- scientific article; zbMATH DE number 2215668 (Why is no real title available?)
- A numerically stable algorithm for two server queue models
- A queueing model for a terminal system subject to breakdowns
This page was built for publication: Explicit and Iterative Numerical Approaches to Solving Queueing Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685808)