Construction of a stationary FIFO queue with impatient customers
| dc.creator | Moyal, Pascal | |
| dc.date | 2008-02-18 | |
| dc.date.accessioned | 2026-07-07T09:21:33Z | |
| dc.date.available | 2026-07-07T09:21:33Z | |
| dc.description | 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 stochastic recursions under the Palm settings, and by stochastic comparison of stochastic recursions. | |
| dc.identifier | https://arxiv.org/abs/0802.2495 | |
| dc.identifier | http://arxiv.org/abs/0802.2495 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155063 | |
| dc.subject | Probability | |
| dc.subject | 60F17 (Primary); 60K25, 60B12 (Secondary) | |
| dc.title | Construction of a stationary FIFO queue with impatient customers | |
| dc.type | text |