Transient probabilities of a single server priority queueing system

DOI10.1016/S0378-3758(01)00176-8MaRDI QIDQ1347979zbMATH OpenFDO

Authors LiPing Chu, Alan Krinik, Ray C. Shiflett, Daniel A. Marcus

Publication date 15 May 2002

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

Full work available at URL https://doi.org/10.1016/S0378-3758(01)00176-8

zbMATH Keywords

lattice pathpriority queueing systemprobability functions

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3164122 (Why is no real title available?)
• scientific article; zbMATH DE number 4076264 (Why is no real title available?)
• scientific article; zbMATH DE number 50893 (Why is no real title available?)
• Priority queues
• Queuing with preemptive priorities or with breakdown
• The combinatorics of birth-death processes and applications to queues
• The time-dependent problem for a queue with preemptive priorities

Cited in

(8)

• Lattice path approaches for busy period density of GI^b/G/1 queues using C₂ Coxian distributions
• Waiting time in a combined first-come-first-served and shortest-time-first queue.
• The discrete-time preemptive repeat identical priority queue
• On the transient distribution of a single and batch service queueing system with accessibility to the batches
• Double orbit finite retrial queues with priority customers and service interruptions
• scientific article; zbMATH DE number 3941239 (Why is no real title available?)
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1347979)