Stationarity of pure delay systems and queues with impatient customers via stochastic recursions

Original · EN

In this paper we solve a particular stochastic recursion in the stationary ergodic framework, and propose some applications of this result to the study of regenerativity (that is, finiteness of busy cycles) and stationarity of some queueing systems: pure delay systems, in which all customers are immediately served, and queues with impatient customers. In this latter case under the FIFO discipline, we prove as well the existence of a stationary workload on an enlarged probability space.