THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS
From MaRDI portal
Publication:2884251
DOI10.1017/S0269964811000155zbMath1241.60038MaRDI QIDQ2884251
Benny Van Houdt, Juan F. Pérez
Publication date: 24 May 2012
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
\(BMAP[2/PH[2]/1\) preemptive priority queue]\(BMAP/PH/1\) queue\(M/G/1\)-type Markov chains
Continuous-time Markov processes on general state spaces (60J25) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (3)
A fast Newton-Shamanskii iteration for a matrix equation arising from M/G/1-type Markov chains ⋮ A Compressed Cyclic Reduction for QBD processes with Low-Rank Upper and Lower Transitions ⋮ A Fast Newton's Iteration for M/G/1-Type and GI/M/1-Type Markov Chains
Cites Work
- A general class of Markov processes with explicit matrix-geometric solutions
- On approximating higher order MAPs with MAPs of order two
- Markov chains with marked transitions
- Solving nonlinear matrix equations arising in tree-like stochastic processes.
- A matrix-analytic solution for the DBMAP/PH/ 1 priority queue
- New results on the single server queue with a batch markovian arrival process
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- A Hessenberg-Schur method for the problem AX + XB= C
- Computation of Steady-State Probabilities for M/M/1 Priority Queues
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- An improved FFT-based version of Ramaswami's formula
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
- Numerical Methods for Structured Markov Chains
- Representation Theory for Denumerable Markov Chains
This page was built for publication: THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS