Construction of a stationary FIFO queue with impatient customers

Details Construction of a stationary FIFO queue with impatient customers Construction of a stationary FIFO queue with impatient customers

2008-02-18

arxiv.org/abs/0802.2495v1

Mathematics

Probability

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Construction of a stationary FIFO queue with impatient customers 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 Construction of a stationary FIFO queue with impatient customers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of a stationary FIFO queue with impatient customers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-197990