A general class of Markov processes with explicit matrix-geometric solutions

DOI10.1007/BF01721131MaRDI QIDQ1088296zbMATH OpenOpenAlexFDO

Authors V. Ramswami, Guy Latouche

Publication date 1986

Published in OR Spektrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01721131

zbMATH Keywords

stationary probability vectormatrix-geometric form

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

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

(23)

• Ticket queues with regular and strategic customers
• Markov processes on a semi-infinite strip and the geometric tail algorithm
• The shortest queue model with jockeying
• Several Types of Ergodicity for M/G/1-Type Markov Chains and Markov Processes
• Matrix-geometric solutions for bulk GI/M/1 systems with unbounded arrival groups
• Level product form QSF processes and an analysis of queues with Coxian interarrival distribution
• Computational schemes for two exponential servers where the first has a finite buffer
• Analysis of multiserver queues with constant retrial rate
• Analysis of a synchronization station for the performance evaluation of a kanban system with a general arrival process of demands
• Quasi-Birth-and-Death Processes with an Explicit Rate Matrix
• The \(M/G/1\)-type Markov chain with restricted transitions and its application to queues with batch arrivals
• A matrix-geometric solution of the jockeying problem
• Comparing Some Algorithms for Solving QBD Processes Exhibiting Special Structures
• Matrix structures in queuing models
• Quasi-Birth-and-Death Processes, Lattice Path Counting, and Hypergeometric Functions
• Some decomposition results for a class of vacation queues
• An explicit analysis of the lead time syndrome: stability condition and performance evaluation
• A compressed cyclic reduction for QBD processes with low-rank upper and lower transitions
• Geometric Markov chains
• Strategic customer behavior in a two-stage batch processing system
• Matrix-geometric analysis of the shortest queue problem with threshold jockeying
• Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue
• Upper and lower bounds for the waiting time in the symmetric shortest queue system

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)