Asymptotic Expansions for the Sojourn Time Distribution in the $M/G/1$-PS Queue

Details Asymptotic Expansions for the Sojourn Time Distribution in the $M/G/1$-PS Queue Asymptotic Expansions for the Sojourn Time Distribution in the $M/G/1$-PS Queue

2009-02-06

arxiv.org/abs/0902.1199v1

Math. Meth. Oper. Res. 71 (2010) 201-244

Mathematics

Probability

45 pages

Scientific paper

10.1007/s00186-009-0290-9

We consider the $M/G/1$ queue with a processor sharing server. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, as well as the unconditional distribution, in various asymptotic limits. These include large time and/or large service request, and heavy traffic, where the arrival rate is only slightly less than the service rate. Our results demonstrate the possible tail behaviors of the unconditional distribution, which was previously known in the cases $G=M$ and $G=D$ (where it is purely exponential). We assume that the service density decays at least exponentially fast. We use various methods for the asymptotic expansion of integrals, such as the Laplace and saddle point methods.

Affiliated with

Also associated with

No associations

Rating

Asymptotic Expansions for the Sojourn Time Distribution in the $M/G/1$-PS Queue 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 Asymptotic Expansions for the Sojourn Time Distribution in the $M/G/1$-PS Queue, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Expansions for the Sojourn Time Distribution in the $M/G/1$-PS Queue will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-311804