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

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

2006-03-30

arxiv.org/abs/math/0603709v3

Mathematics

Probability

This paper has been withdrawn by the author. This paper has been published in a newer version, arXiv:0802.2495

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Stationarity of pure delay systems and queues with impatient customers via stochastic recursions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stationarity of pure delay systems and queues with impatient customers via stochastic recursions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stationarity of pure delay systems and queues with impatient customers via stochastic recursions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-141744