On the behavior of LIFO preemptive resume queues in heavy traffic

DOI10.1214/ECP.v5-1014zbMath0955.60097MaRDI QIDQ1977460

Vlada Limic

Publication date: 18 May 2000

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/120804

zbMATH Keywords

feedbackWiener-Hopf factorizationbranchingmeasure-valued processrenewalLIFO queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (7)

Diffusion approximation for a processor sharing queue in heavy traffic. ⋮ Conjectures on symmetric queues in heavy traffic ⋮ Scaling limit of a limit order book model via the regenerative characterization of Lévy trees ⋮ Processor sharing: a survey of the mathematical theory ⋮ The depth first processes of Galton-Watson trees converge to the same Brownian excursion ⋮ Heavy traffic analysis for EDF queues with reneging ⋮ An \(\mathrm{M}/\mathrm{G}/1\) retrial G-queue with preemptive resume priority and collisions subject to the server breakdowns and delayed repairs

This page was built for publication: On the behavior of LIFO preemptive resume queues in heavy traffic