Transient probabilities of a single server priority queueing system

DOI10.1016/S0378-3758(01)00176-8zbMath0994.05011MaRDI QIDQ1347979

Dan Marcus, LiPing Chu, Ray C. Shiflett, A. C. Krinik

Publication date: 15 May 2002

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

lattice pathprobability functionspriority queueing system

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Queueing theory (aspects of probability theory) (60K25)

Related Items (6)

Double orbit finite retrial queues with priority customers and service interruptions ⋮ Waiting time in a combined first-come-first-served and shortest-time-first queue. ⋮ Busy period analysis of queue: lattice path approach ⋮ Lattice path approach for busy period density of \(GIa/Gb/1\) queues using \(C_{2}\) Coxian distributions ⋮ The discrete-time preemptive repeat identical priority queue ⋮ Lattice path approaches for busy period density of \(GI^b/G/1\) queues using \(C_2\) Coxian distributions

Cites Work

• The combinatorics of birth-death processes and applications to queues
• Priority queues
• The Time-Dependent Problem for a Queue with Preemptive Priorities
• Queuing with Preemptive Priorities or with Breakdown
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Transient probabilities of a single server priority queueing system