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

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.