Earliest-deadline-first service in heavy-traffic acyclic networks

Annals of Applied Probability

Volumn 14, Issue 3, 2004, Pages 1306-1352

  Kruk, Łukasz ^a   Lehoczky, John ^b   Shreve, Steven ^b   Yeung, Shu Ngai ^c,d  

^a MARIA CURIE SK ODOWSKA UNIVERSITY   (Poland)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c AT AND T LABS RESEARCH   (United States)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

Acyclic networks; Diffusion limits; Due dates; Heavy traffic; Queueing; Random measures

Indexed keywords

EID: 6944238857     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/105051604000000314     Document Type: Article

References (17)

1. BILLINGSLEY, P. (1986). Probability and Measure, 2nd ed. Wiley, New York.
2. BILLINGSLEY, P. (1999). Convergence of Probability Measures, 2nd ed. Wiley, New York.
3. BOURBAKI, N. (1966). General Topology 1. Addison-Wesley, Reading, MA.
4. BRAMSON, M. (2004). Stability of earliest-due-date, first-served queueing networks. Queueing Syst. Theory Appl. To appear.
5. DOYTCHINOV, B., LEHOCZKY, J. P. and SHREVE, S. E. (2001). Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11 332-379.
6. ETHIER, S. N. and KURTZ, T. G. (1985). Markov Processes: Characterization and Convergence. Wiley, New York.
7. HARRISON, J. M. (1995). Balanced fluid models of multiclass queueing networks: A heavy traffic conjecture. In Stochastic Networks (F. P. Kelly and R. Williams, eds.) 1-20. Springer, New York.
8. KRUK, Ł., LEHOCZKY, J. P., SHREVE, S. E. and YEUNG, S. N. (2003). Multiple-input heavy-traffic real-time queues. Ann. Appl. Probab. 13 54-99.
9. LEHOCZKY, J. P. (1997). Using real-time queueing theory to control lateness in real-time systems. Performance Evaluation Review 25 158-168.
10. LEHOCZKY, J. P. (1998). Real-time queueing theory. In Proceedings of the IEEE Real-Time Systems Symposium 186-195.
11. LEHOCZKY, J. P. (1998). Scheduling communication networks carrying real-time traffic. In Proceedings of the IEEE Real-Time Systems Symposium 470-479.
12. MARKOWITZ, D. M. and WEIN, L. M. (2001). Heavy traffic analysis of dynamic cyclic policies: A unified treatment of the single machine scheduling problem. Oper. Res. 49 246-270.
13. PETERSON, W. P. (1991). A heavy traffic limit theorem for networks of queues with different customer types. Math. Oper. Res. 16 90-118.
14. PROKHOROV, YU. (1956). Convergence of random processes and limit theorems in probability theory. Theory Probab. Appl. 1 157-214.
15. VAN MIEGHEM, J. A. (1995). Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5 809-833.
16. WILLIAMS, R. J. (1998). Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Systems Theory Appl. 30 27-88.
17. YEUNG, S. N. and LEHOCZKY, J. P. (2002). Real-time queueing networks in heavy traffic with EDF and FIFO queue discipline. Working paper, Dept. Statistics, Carnegie Mellon Univ.