Recursive computation of steady-state probabilities in priority queues

Abstract

Recursive formulas are derived for computing the state probabilities in priority queuing systems (preemptive and nonpreemptive). The derivation is based only on the general structure of the generating function involved, and thus is similar and more general than previous methods. Also discussed are the applications of the method to other queuing systems.<>