This paper presents a second-order heavy traffic analysis of a single server queue that processes customers having deadlines using the earliest-deadline-first scheduling policy. For such systems, referred to as real-time queueing systems, performance is measured by the fraction of customers who meet their deadline, rather than more traditional performance measures, such as customer delay, queue length or server utilization. To model such systems, one must keep track of customer lead times (the time remaining until a customer deadline elapses) or equivalent information. This paper reviews the earlier heavy traffic analysis of such systems that provided approximations to the system’s behavior. The main result of this paper is the development of a second-order analysis that gives the accuracy of the approximations and the rate of convergence of the sequence of real-time queueing systems to its heavy traffic limit.
Publié le : 2006-05-14
Classification:
State space collapse,
due dates,
heavy traffic,
queueing,
diffusion limits,
random measures,
60K25,
60G57,
60J65,
68M20
@article{1151592242,
author = {Kruk, \L ukasz and Lehoczky, John and Shreve, Steven},
title = {Accuracy of state space collapse for earliest-deadline-first queues},
journal = {Ann. Appl. Probab.},
volume = {16},
number = {1},
year = {2006},
pages = { 516-561},
language = {en},
url = {http://dml.mathdoc.fr/item/1151592242}
}
Kruk, Łukasz; Lehoczky, John; Shreve, Steven. Accuracy of state space collapse for earliest-deadline-first queues. Ann. Appl. Probab., Tome 16 (2006) no. 1, pp. 516-561. http://gdmltest.u-ga.fr/item/1151592242/