2006/03/30 by Pascal Moyal, Moyal, Pascal
Business, Management and Accounting · Decision Sciences · Mathematics · #60F17 #Advanced Queuing Theory Analysis #FOS: Mathematics #Probability (math.PR) #Probability and Risk Models #math.PR #msc:60F17
paper · pdf · doi:10.48550/arxiv.math/0603709
This paper has been withdrawn by the author. This paper has been published in a newer version, arXiv:0802.2495
openalex publication_date 2006/03/30 · arxiv created 2010/09/07 · arxiv updated 2010/09/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.