Semi-explicit solutions for M/PH/1-like queueing systems
type: Item
instance of: scholarly article
title: Semi-explicit solutions for M/PH/1-like queueing systems
zbMATH Open document ID: 0532.60095
DOI: 10.1016/0377-2217(83)90077-2
author: Fabienne Gillent
author: Guy Latouche
published in: European Journal of Operational Research
publication date: 1983-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 60J10
zbMATH DE Number: 3844798
zbMATH Keywords: Poisson input
zbMATH Keywords: phase service
zbMATH Keywords: queue length
zbMATH Keywords: matrix-geometric approach
MaRDI profile type: Publication
full work available at URL: 0377-2217(83)90077-2
OpenAlex ID: W1969803736
cites work: Algorithmic analysis of Markovian model for a system with batch and interactive jobs
cites work: A Queueing System in Which Customers Require a Random Number of Servers
cites work: Priority queues
cites work: Renewal processes of phase type
cites work: The M/M/1 queue with randomly varying arrival and service rates
cites work: Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector
cites work: Queues Solvable without Rouché's Theorem
cites work: The probabilistic significance of the rate matrix in matrix-geometric invariant vectors
cites work: Explicit Steady-State Solutions to Some Elementary Queueing Models
cites work: Q3923308
description: scientific article; zbMATH DE number 3844798