Computation of Steady-State Probabilities for M/M/1 Priority Queues

1 October 1981

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 29 (5) , 945-958
https://doi.org/10.1287/opre.29.5.945

Abstract

Recursive computational formulas for the steady-state distributions of exponential single-server (preemptive and nonpreemptive) priority queues with two classes of customers are derived using Neuts’ theory of matrix-geometric invariant probability vectors.

Keywords

STEADY STATE
USING NEUTS
EXPONENTIAL SINGLE
COMPUTATIONAL FORMULAS
QUEUES RECURSIVE
RECURSIVE COMPUTATIONAL
DERIVED USING
INVARIANT PROBABILITY
SINGLE SERVER

This publication has 0 references indexed in Scilit: