Computation of Steady-State Probabilities forM/M/1 Priority Queues
Operations Research · 1981 · Volume 29 · Issue 5
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
698, 705 computation of steady-state probabilities for M/M1/PRI
Enable JavaScript for citation tools and additional paper interactions.