Recursive computation of steady-state probabilities in priority queues

DOI10.1016/0167-6377(90)90069-HzbMath0705.60085MaRDI QIDQ918039

Israel Cidon, Moshe Sidi

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

steady-state probabilitiespriority queueing systemsstructure of the generating function

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

On a dual queueing system with preemptive priority service discipline ⋮ The Israeli Queue with Priorities

Cites Work

• Unnamed Item
• Priority queues
• Priority Queues
• Analysis of a non-preemptive priority multiserver queue
• Computation of Steady-State Probabilities for M/M/1 Priority Queues
• An Inversion Technique for the Laplace Transform
• Two Discrete-Time Queues in Tandem
• Queuing with Preemptive Priorities or with Breakdown
• Investigation of a Modified Mid-Point Quadrature Formula
• State Probabilities of M/M/1 Priority Queues

This page was built for publication: Recursive computation of steady-state probabilities in priority queues