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

DOI10.1007/BF01721131zbMath0612.60057OpenAlexW1993053692MaRDI QIDQ1088296

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)

Related Items (20)

THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS ⋮ Matrix-geometric analysis of the shortest queue problem with threshold jockeying ⋮ Quasi-Birth-and-Death Processes with an Explicit Rate Matrix ⋮ An explicit analysis of the lead time syndrome: stability condition and performance evaluation ⋮ Quasi-Birth-and-Death Processes, Lattice Path Counting, and Hypergeometric Functions ⋮ Some decomposition results for a class of vacation queues ⋮ Comparing Some Algorithms for Solving QBD Processes Exhibiting Special Structures ⋮ Matrix Structures in Queuing Models ⋮ Ticket queues with regular and strategic customers ⋮ Computational schemes for two exponential servers where the first has a finite buffer ⋮ A matrix-geometric solution of the jockeying problem ⋮ Analysis of multiserver queues with constant retrial rate ⋮ Strategic customer behavior in a two-stage batch processing system ⋮ Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue ⋮ Analysis of a synchronization station for the performance evaluation of a kanban system with a general arrival process of demands ⋮ Several Types of Ergodicity for M/G/1-Type Markov Chains and Markov Processes ⋮ A Compressed Cyclic Reduction for QBD processes with Low-Rank Upper and Lower Transitions ⋮ Level product form QSF processes and an analysis of queues with <scp>C</scp> oxian interarrival distribution ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system ⋮ The shortest queue model with jockeying

Cites Work

• Unnamed Item
• Unnamed Item
• Semi-explicit solutions for M/PH/1-like queueing systems
• The busy period of queues which have a matrix-geometric steady state probability vector
• Operator-geometric stationary distributions for markov chains, with application to queueing models
• Moment formulas for the Markov renewal branching process

This page was built for publication: A general class of Markov processes with explicit matrix-geometric solutions