Recursive computation of steady-state probabilities in priority queues

  • Authors:

  • Israel Cidon;Moshe Sidi

  • Affiliations:

  • IBM, Thomas J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598, USA;Electrical Engineering Department, Technion - Israel Institute of Technology, Haifa 32000, Israel

  • Venue:
  • Operations Research Letters
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Exact recursive formulas are derived for 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. Furthermore, applications of the method to other queueing systems are discussed.