Uniform Approximations for the M/G/1 Queue with Subexponential Processing Times

Details Uniform Approximations for the M/G/1 Queue with Subexponential Processing Times Uniform Approximations for the M/G/1 Queue with Subexponential Processing Times

2010-09-27

arxiv.org/abs/1009.5327v2

Mathematics

Probability

Scientific paper

This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide insights into the regions of large deviations where the so-called heavy traffic approximation and heavy tail asymptotic hold. For queues whose service time distribution decays slower than e^{-sqrt{t}} we identify a third region of asymptotics where neither the heavy traffic nor the heavy tailed approximations are valid. These results are obtained by deriving approximations for P(W_infty > x) that are either uniform in the traffic intensity as the tail value goes to infinity or uniform on the positive axis as the traffic intensity converges to one. Our approach makes clear the connection between the asymptotic behavior of the steady-state waiting time distribution and that of an associated random walk.

Affiliated with

Also associated with

No associations

Rating

Uniform Approximations for the M/G/1 Queue with Subexponential Processing Times 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 Uniform Approximations for the M/G/1 Queue with Subexponential Processing Times, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniform Approximations for the M/G/1 Queue with Subexponential Processing Times will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-518444