Accuracy of state space collapse for earliest-deadline-first queues

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.

[1]  S. Shreve,et al.  Real-time queues in heavy traffic with earliest-deadline-first queue discipline , 2001 .

[2]  Ioannis Karatzas,et al.  Brownian Motion and Stochastic Calculus , 1987 .

[3]  D. Iglehart.  Multiple channel queues in heavy traffic , 1971, Advances in Applied Probability.

[4]  Yu. V. Prokhorov.  Convergence of Random Processes and Limit Theorems in Probability Theory , 1956 .

[5]  J. Wellner,et al.  Empirical Processes with Applications to Statistics , 2009 .

[6]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[7]  D. Iglehart,et al.  The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums , 1971 .

[8]  Peter J. Bickel,et al.  Convergence Criteria for Multiparameter Stochastic Processes and Some Applications , 1971 .

[9]  John P. Lehoczky,et al.  Multiple-input heavy-traffic real-time queues , 2003 .

[10]  Don Towsley,et al.  Optimality of the Stochastic Earliest Deadline Policy for the G/M/c Queue Serving Customers with Deadlines , 1991 .

[11]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. I , 1970, Advances in Applied Probability.

[12]  Xiongzhi Chen.  Brownian Motion and Stochastic Calculus , 2008 .

[13]  Zhang Hanqin,et al.  MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC , 1990 .

[14]  S. Shreve,et al.  Earliest-deadline-first service in heavy-traffic acyclic networks , 2004, math/0407136.

[15]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[16]  John P. Lehoczky.  Scheduling communication networks carrying real-time traffic , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[17]  Ward Whitt,et al.  An Introduction to Stochastic-Process Limits and their Application to Queues , 2002 .