Recursive computation of steady-state probabilities in priority queues

We derive recursive formulas for computing the state probabilities in priority queueing systems (preemptive and non-preemptive). The derivation is based only on the general structure of the generating function involved, and thus is simpler and more general than previous methods. We also discuss the applications of the method to other queueing systems. © 1989 IEEE.