Real-time queues in heavy traffic with earliest-deadline-first queue discipline

Annals of Applied Probability

Volumn 11, Issue 2, 2001, Pages 332-378

  Doytchinov, Bogdan ^a   Lehoczky, John ^b   Shreve, Steven ^b  

^a Worcester Polytechnic Institute   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

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

Indexed keywords

EID: 0035538458     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1015345295     Document Type: Article

References (30)

1. BILLINGSLEY, P. (1968). Convergence of Probability Measures. Wiley, New York.
2. COFFMAN, E. G., JR., PUHALSKII, A. A. and REIMAN, M. I. (1995). Polling systems with zero switchover times: A heavy traffic-traffic averaging principle. Ann. Appl. Probab. 5 681-719.
3. DOYTCHINOV, B. (1997). Heavy traffic limits of queues with due dates. Ph.D. dissertation, Dept. Mathematical Sciences, Carnegie Mellon Univ.
4. ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes. Characterization and Convergence. Wiley, New York.
5. HARRISON, J. M. (1973). A limit theorem for priority queues in heavy traffic. J. Appl. Probab. 10 907-912.
6. HARRISON, J. M. (1985). Brownian Motion and Stochastic Flow Systems. Wiley, New York.
7. HARRISON, J. M. (1988). Brownian models of queueing networks with heterogeneous customer populations. In Proceedings of the IMA Workshop on Stochastic Differential Systems 147-186. Springer, New York.
8. HARRISON, J. M. and NGUYEN, V. (1993). Brownian models of multiclass queueing networks: Current status and open problems. Queueing Systems Theory Appl. 13 5-40.
9. HARRISON, J. M. and WEIN, L. J. (1990). Scheduling networks of queues: Heavy traffic analysis of a two-station closed network. Oper. Res. 38 1052-1064.
10. HONG, J., TAN, X. and TOWSLEY, D. (1989). A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system. IEEE Trans. Comput. 38 1736-1744.
11. HOOKE, J. (1970). On some limit theorems for the GI/G/1 queue. J. Appl. Probab. 7 634-640.
12. IGLEHART, D. and WHITT, W. (1970). Multiple channel queues in heavy traffic I. Adv. in Appl. Probab. 2 150-177.
13. IGLEHART, D. and WHITT, W. (1970). Multiple channel queues in heavy traffic II. Adv. in Appl. Probab. 2 355-364.
14. KINGMAN, J. F. C. (1961). The single server queue in heavy traffic. Proceedings of the Cambridge Philosophical Society 48 277-289.
15. KLEIN, M., RALYA, T., POLLAK, B., OBENZA, R. and GONZALEZ-HARBOUR, M. (1993). A Practitioner's Handbook for Real-Time Analysis. Kluwer, Dordrecht.
16. KYPRIANOU, E. (1971). The virtual waiting time of the GI/G/1 queue in heavy traffic. Adv. in Appl. Probab. 3 249-268.
17. LEHOCZKY, J. P. (1996). Real-time queueing theory. In Proceedings of the IEEE Real-Time Systems Symposium 186-195. IEEE, New York.
18. LEHOCZKY, J. P. (1997). Using real-time queueing theory to control lateness in real-time systems. Performance Evaluation Review 25 158-168.
19. LEHOCZKY, J. P. (1997). Real-time queueing network theory. In Proceedings of the IEEE Real-Time Systems Symposium 58-67. IEEE, New York.
20. LIU, C. L. and LAYLAND, J. W. (1973). Scheduling algorithms for multiprogramming in a hard real-time environment. J. Assoc. Comput. Mach. 20(1) 40-61.
21. MARKOWITZ, D. M. and WEIN, L. M. (1996). Heavy traffic analysis of dynamic cyclic policies: A unified treatment of the single machine scheduling problem. Preprint, Sloan School of Management, MIT.
22. PANWAR, S. and TOWSLEY, D. (1988). On the optimality of the STE rule for multiple server queues that serve customers with deadlines. Technical Report 88-81, Dept. Computer and Information Science, Univ. Massachusetts, Amherst.
23. PARTHASARATHY, K. R. (1967). Probability Measures on Metric Spaces, Academic Press, New York.
24. PETERSON, W. P. (1991). A heavy traffic limit theorem for networks of queues with multiple customer types. Math. Oper. Res. 16 90-118.
25. PROKHOROV, YU. (1956). Convergence of random processes and limit theorems in probability theory. Theory Probab. Appl. 1 157-214.
26. REIMAN, M. (1983). Some diffusion approximations with state space collapse. In Proceedings of the International Seminar on Modeling and Performance Evaluation Methodology. Springer, Berlin.
27. REIMAN, M. (1988). A multiclass feedback queue in heavy traffic. Adv. in Appl. Probab. 20 179-207.
28. VAN MIEGHEM, J. A. (1995). Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5 809-833.
29. WEIN, L. J. (1990). Scheduling networks of queues: Heavy traffic analysis of a two-station network with controllable inputs. Oper. Res. 38 1065-1078.
30. WHITT, W. (1971). Weak convergence theorems for priority queues: Preemptive-resume discipline. J. Appl. Probab. 8 74-94.