Mathematics – Probability
Scientific paper
2011-04-06
Annals of Applied Probability 2011, Vol. 21, No. 2, 484-545
Mathematics
Probability
Published in at http://dx.doi.org/10.1214/10-AAP681 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Inst
Scientific paper
10.1214/10-AAP681
This paper presents a heavy-traffic analysis of the behavior of a single-server queue under an Earliest-Deadline-First (EDF) scheduling policy in which customers have deadlines and are served only until their deadlines elapse. The performance of the system is measured by the fraction of reneged work (the residual work lost due to elapsed deadlines) which is shown to be minimized by the EDF policy. The evolution of the lead time distribution of customers in queue is described by a measure-valued process. The heavy traffic limit of this (properly scaled) process is shown to be a deterministic function of the limit of the scaled workload process which, in turn, is identified to be a doubly reflected Brownian motion. This paper complements previous work by Doytchinov, Lehoczky and Shreve on the EDF discipline in which customers are served to completion even after their deadlines elapse. The fraction of reneged work in a heavily loaded system and the fraction of late work in the corresponding system without reneging are compared using explicit formulas based on the heavy traffic approximations. The formulas are validated by simulation results.
Kruk Łukasz
Lehoczky John
Ramanan Kavita
Shreve Steven
No associations
LandOfFree
Heavy traffic analysis for EDF queues with reneging 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 Heavy traffic analysis for EDF queues with reneging, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heavy traffic analysis for EDF queues with reneging will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-417816