On the behavior of LIFO preemptive resume queues in heavy traffic
From MaRDI portal
Publication:1977460
DOI10.1214/ECP.v5-1014zbMath0955.60097MaRDI QIDQ1977460
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
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Related Items
Heavy traffic analysis for EDF queues with reneging, Processor sharing: a survey of the mathematical theory, The depth first processes of Galton-Watson trees converge to the same Brownian excursion, Scaling limit of a limit order book model via the regenerative characterization of Lévy trees, Diffusion approximation for a processor sharing queue in heavy traffic., Conjectures on symmetric queues in heavy traffic, An \(\mathrm{M}/\mathrm{G}/1\) retrial G-queue with preemptive resume priority and collisions subject to the server breakdowns and delayed repairs