A general class of Markov processes with explicit matrix-geometric solutions
From MaRDI portal
We consider a class of Markov chains for which the stationary probability vector, when it exists, is of the matrix-geometric form. The essential step in the computational algorithm usually is the evaluation of a matrix R. We consider two general cases for which that matrix is explicitly determined.
Recommendations
- scientific article; zbMATH DE number 967330
- Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method
- On the solution of the generalized Markov equation
- Matrix-geometric invariant measures for G/M/l type Markov chains
- scientific article; zbMATH DE number 1531952
- scientific article; zbMATH DE number 4136030
- Geometric bounds for eigenvalues of Markov chains
Cites work
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 3236503 (Why is no real title available?)
- Moment formulas for the Markov renewal branching process
- Operator-geometric stationary distributions for markov chains, with application to queueing models
- Semi-explicit solutions for M/PH/1-like queueing systems
- The busy period of queues which have a matrix-geometric steady state probability vector
Cited in
(27)- Analysis of a synchronization station for the performance evaluation of a kanban system with a general arrival process of demands
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- Some decomposition results for a class of vacation queues
- Markov processes on a semi-infinite strip and the geometric tail algorithm
- Ticket queues with regular and strategic customers
- Strategic customer behavior in a two-stage batch processing system
- Matrix-geometric analysis of the shortest queue problem with threshold jockeying
- A compressed cyclic reduction for QBD processes with low-rank upper and lower transitions
- The \(M/G/1\)-type Markov chain with restricted transitions and its application to queues with batch arrivals
- Matrix structures in queuing models
- Computational schemes for two exponential servers where the first has a finite buffer
- Level product form QSF processes and an analysis of queues with Coxian interarrival distribution
- An explicit analysis of the lead time syndrome: stability condition and performance evaluation
- Quasi-Birth-and-Death Processes with an Explicit Rate Matrix
- The shortest queue model with jockeying
- Matrix-geometric solutions for bulk GI/M/1 systems with unbounded arrival groups
- Geometric Markov chains
- Quasi-Birth-and-Death Processes, Lattice Path Counting, and Hypergeometric Functions
- Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue
- Several Types of Ergodicity for M/G/1-Type Markov Chains and Markov Processes
- scientific article; zbMATH DE number 967330 (Why is no real title available?)
- A matrix-geometric solution of the jockeying problem
- Analysis of multiserver queues with constant retrial rate
- Comparing Some Algorithms for Solving QBD Processes Exhibiting Special Structures
- A computational approach to extreme values and related hitting probabilities in level-dependent quasi-birth-death processes
- A note on an efficient approach for solving quasi-birth-and-death processes exhibiting special structures
- Strategic behavior in a Markovian ticket queue with non-negligible clearance times
This page was built for publication: A general class of Markov processes with explicit matrix-geometric solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1088296)
