On the behavior of LIFO preemptive resume queues in heavy traffic
Vlada Limic
This paper studies heavy traffic behavior of a G\G\1
last-in-first-out
(LIFO)
preemptive resume
queue, by extending
the techniques
developed in Limic (1999). The queue length process
exhibits a perhaps unexpected heavy traffic behavior.
The diffusion limit depends
on the type of arrivals (and services) in a fairly intricate way,
related to the Wiener-Hopf factorization for random walks.
Keywords.
LIFO queue, heavy traffic, measure-valued process, branching,
feedback, renewal, Wiener-Hopf factorization