Diffusion limits for shortest remaining processing time queues

Details Diffusion limits for shortest remaining processing time queues Diffusion limits for shortest remaining processing time queues

2010-05-06

arxiv.org/abs/1005.1035v2

Mathematics

Probability

19 pages; revised, fixed typos. To appear in Stochastic Systems

Scientific paper

We present a heavy traffic analysis for a single server queue with renewal arrivals and generally distributed i.i.d. service times, in which the server employs the Shortest Remaining Processing Time (SRPT) policy. Under typical heavy traffic assumptions, we prove a diffusion limit theorem for a measure-valued state descriptor, from which we conclude a similar theorem for the queue length process. These results allow us to make some observations on the queue length optimality of SRPT. In particular, they provide the sharpest illustration of the well-known tension between queue length optimality and quality of service for this policy.

Affiliated with

Also associated with

No associations

Rating

Diffusion limits for shortest remaining processing time queues 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 Diffusion limits for shortest remaining processing time queues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Diffusion limits for shortest remaining processing time queues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26641