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

Publication date: 30 March 2006

Abstract: 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.

Mathematics Subject Classification ID

Functional limit theorems; invariance principles (60F17)

This page was built for publication: Stationarity of pure delay systems and queues with impatient customers via stochastic recursions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6476942)