Pascal Moyal
Published 2007-09-19, updated 2010-09-07Version 2
In this paper, we study the stability of queues with impatient customers. Under general stationary ergodic assumptions, we first provide some conditions for such a queue to be regenerative (i.e. to empty a.s. an infinite number of times). In the particular case of a single server operating in First in, First out, we prove the existence (in some cases, on an enlarged probability space) of a stationary workload. This is done by studying a non-monotonic stochastic recursion under the Palm settings, and by stochastic comparison of stochastic recursions.
Comments: This paper has been withdrawn by the author. This paper has been published in a newer version, arXiv:0802.2495
Construction of a stationary FIFO queue with impatient customers
Diffusions on a space of interval partitions: construction from Bertoin's ${\tt BES}_0(d)$, $d\in(0,1)$
A simple analysis of a D/GI/1 vacation queue with impatient customers
![QR code for arXiv:0709.3012 [math.PR]](http://oss.arxitics.com/images/favicon.svg)