论文信息 - Semi-explicit solutions for M/PH/1-like queuing systems

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

Abstract A large class of queuing systems have a stationary probability vector of matrix-geometric form. The essential step in the computation algorithm is the evaluation of a matrix R , the unique nonnegative solution of a matrix quadratic equation. The matrix R is usually determined by successive approximations. An explicit form of R is proposed, for systems that resemble the M/PH/1 queue.

Guy Latouche | Fablenne Gillent

[1] Marcel F. Neuts,et al. Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[2] Marcel F. Neuts,et al. Queues Solvable without Rouché's Theorem , 1979, Oper. Res..

[3] Marcel F Neuts,et al. The M/M/1 Queue with Randomly Varying Arrival and Service Rates. , 1977 .

[4] Marcel F. Neuts. Explicit Steady-State Solutions to Some Elementary Queueing Models , 1982, Oper. Res..

[5] M. Neuts. Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector , 1978, Advances in Applied Probability.

[6] N. K. Jaiswal,et al. Priority queues , 1968 .

[7] Marcel F. Neuts. The probabilistic significance of the rate matrix in matrix-geometric invariant vectors , 1980 .

[8] Linda Green,et al. A Queueing System in Which Customers Require a Random Number of Servers , 1980, Oper. Res..

[9] Guy Latouche,et al. Algorithmic Analysis of a Markovian Model for a System with Batch and Interactive Jobs. , 1980 .

[10] M. Neuts. Renewal processes of phase type , 1978 .