Solutions of the basic matrix equation for M/G/l AND G/M/1 type markov chains

DOI10.1080/15326349408807287zbMath0791.60086OpenAlexW2164138681MaRDI QIDQ4288000

S. L. Hantler, H. R. Gail, B. Alan Taylor

Publication date: 7 July 1994

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349408807287

zbMATH Keywords

Markov chainssubstochastic matrixsubstochastic and stochastic solutions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (15)

On the Time Reversal of Markovian Arrival Processes ⋮ Applying Foster's criteria to a \(GI/PH/1\) queueing system ⋮ A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure ⋮ β-Invariant Measures for Transition Matrices of GI/M/1 Type ⋮ On the role of Rouché's theorem in queueing analysis ⋮ Continuous-time QBD processes with continuous phase variable ⋮ Algorithmic computation of \(MAP/PH/1\) queue with finite system capacity and two-stage vacations ⋮ On the Dual Relationship Between Markov Chains of GI/M/1 and M/G/1 Type ⋮ Truncation and augmentation of level-independent QBD processes. ⋮ Stochastic and substochastic solutions for infinite-state Markov chains with applications to matrix-analytic methods ⋮ AMAP/G/1 Queue with an Underlying Birth–Death Process ⋮ Asymptotic properties of the occupation measure in a multidimensional skip-free Markov-modulated random walk ⋮ Relaxed functional iteration techniques for the numerical solution of \(M/G/1\) type Markov chains ⋮ Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system ⋮ Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue]

This page was built for publication: Solutions of the basic matrix equation for M/G/l AND G/M/1 type markov chains