Semi-explicit solutions for M/PH/1-like queueing systems

DOI10.1016/0377-2217(83)90077-2MaRDI QIDQ789113zbMATH OpenOpenAlexFDO

Authors Fabienne Gillent, Guy Latouche

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

zbMATH Keywords

matrix-geometric approachphase servicePoisson inputqueue length

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25)

Review text

A continuous time parameter Markov process with an infinitesimal matrix of a special form is investigated. Such a Markov process describes as basic process queue length for a large class of queueing systems like those with Poisson input and a phase type of service. By means of a matrix-geometric approach the authors obtain important characteristics (such as: conditions for existence of the steady-state of the basic process and its stationary distribution) for a number of modifications and special cases of the mentioned queueing systems.

Recommendations

• The semi-markovian queue: theory and applications
• Markov processes whose steady state distribution is matrix-exponential with an application to the GI/PH/1 queue
• Markov-modulated PH/G/1 queueing systems
• scientific article; zbMATH DE number 6002504
• A new informative embedded Markov renewal process for the PH/G/1 queue

Cites work

• A Queueing System in Which Customers Require a Random Number of Servers
• Algorithmic analysis of Markovian model for a system with batch and interactive jobs
• Explicit Steady-State Solutions to Some Elementary Queueing Models
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector
• Priority queues
• Queues Solvable without Rouché's Theorem
• Renewal processes of phase type
• The M/M/1 queue with randomly varying arrival and service rates
• The probabilistic significance of the rate matrix in matrix-geometric invariant vectors

Cited in

(11)

• Stability criterion of a multiserver model with simultaneous service
• A general class of Markov processes with explicit matrix-geometric solutions
• Matrix-geometric solution of a multiserver queue with Markovian group arrivals and Coxian servers
• On optimal stochastic jumps in multi server queue with impatient customers via stochastic control
• Asymptotic analysis of queueing models based on synchronization method
• Stability conditions for a multiserver queueing system with a regenerative input flow and simultaneous service of a customer by a random number of servers
• A comparative analysis of the successive lumping and the lattice path counting algorithms
• Explicit and Iterative Numerical Approaches to Solving Queueing Models
• Steady-State and Transient Analysis of a Single Channel Cognitive Radio Model with Impatience and Balking
• A matrix-geometric solution of the jockeying problem
• The shorter queue problem: A numerical study using the matrix-geometric solution

This page was built for publication: Semi-explicit solutions for M/PH/1-like queueing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789113)