Stationary workload and service times for some nonwork-conserving M/G/1 preemptive LIFO queues

DOI10.1080/15326349.2022.2074458zbMath1502.60130OpenAlexW4280592596MaRDI QIDQ5044427

Karl Sigman, Jacob Bergquist

Publication date: 31 October 2022

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349.2022.2074458

zbMATH Keywords

stabilityworkloadlast-in-first-outpreemptive LIFOrate conservation law

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Risk theory
• On preemptive-repeat LIFO queues
• The GI/G/1 queue with last-come-first-served
• Appendix: A primer on heavy-tailed distributions
• Stochastic simulation: Algorithms and analysis
• A Review of Regenerative Processes
• A Note on a Sample-Path Rate Conservation Law and its Relationship withH=λG
• On the single-server queue with the preemptive-resume last-come–first-served queue discipline
• INVARIANCE RELATIONS OF GI/G/1 QUEUEING SYSTEMS WITH PREEMPTIVE-RESUME LAST-COME-FIRST-SERVED QUEUE DISCIPLINE
• ON G/G/1 QUEUES WITH LIFO-P SERVICE DISCIPLINE

This page was built for publication: Stationary workload and service times for some nonwork-conserving M/G/1 preemptive LIFO queues