Semi-explicit solutions for M/PH/1-like queueing systems
From MaRDI portal
Publication:789113
DOI10.1016/0377-2217(83)90077-2zbMath0532.60095OpenAlexW1969803736MaRDI QIDQ789113
Guy Latouche, Fabienne Gillent
Publication date: 1983
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(83)90077-2
Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (9)
A general class of Markov processes with explicit matrix-geometric solutions ⋮ Asymptotic analysis of queueing models based on synchronization method ⋮ Matrix-geometric solution of a multiserver queue with Markovian group arrivals and Coxian servers ⋮ Stability criterion of a multiserver model with simultaneous service ⋮ A matrix-geometric solution of the jockeying problem ⋮ A comparative analysis of the successive lumping and the lattice path counting algorithms ⋮ Stability conditions for a multiserver queueing system with a regenerative input flow and simultaneous service of a customer by a random number of servers ⋮ On optimal stochastic jumps in multi server queue with impatient customers via stochastic control ⋮ Steady-State and Transient Analysis of a Single Channel Cognitive Radio Model with Impatience and Balking
Cites Work
- Unnamed Item
- Algorithmic analysis of Markovian model for a system with batch and interactive jobs
- The M/M/1 queue with randomly varying arrival and service rates
- Priority queues
- The probabilistic significance of the rate matrix in matrix-geometric invariant vectors
- Queues Solvable without Rouché's Theorem
- A Queueing System in Which Customers Require a Random Number of Servers
- Explicit Steady-State Solutions to Some Elementary Queueing Models
- Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector
- Renewal processes of phase type
This page was built for publication: Semi-explicit solutions for M/PH/1-like queueing systems
