The queue with impatience: construction of the stationary workload under FIFO
From MaRDI portal
Publication:3578678
DOI10.1239/jap/1276784905zbMath1208.60099MaRDI QIDQ3578678
Publication date: 20 July 2010
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1276784905
stationary solution; queues with impatience; stochastic recursions; dominating sequences; renovating events; stationary workload process
60G10: Stationary stochastic processes
60K25: Queueing theory (aspects of probability theory)
60F17: Functional limit theorems; invariance principles