The queue with impatience: construction of the stationary workload under FIFO

DOI10.1239/JAP/1276784905zbMath1208.60099OpenAlexW2038884059MaRDI QIDQ3578678

Pascal Moyal

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

zbMATH Keywords

stationary solutionqueues with impatiencestochastic recursionsdominating sequencesrenovating eventsstationary workload process

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Queueing theory (aspects of probability theory) (60K25) Functional limit theorems; invariance principles (60F17)

Related Items (4)

On queues with impatience: stability, and the optimality of earliest deadline first ⋮ On the stability of a class of non-monotonic systems of parallel queues ⋮ Coupling in the queue with impatience: case of several servers ⋮ A generalized backward scheme for solving nonmonotonic stochastic recursions

Cites Work

• Stationary solutions of stochastic recursions describing discrete event systems
• Stochastically recursive sequences and their generalizations
• Single-server queues with impatient customers
• Stability of a Processor-Sharing Queue with Varying Throughput
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The queue with impatience: construction of the stationary workload under FIFO