Heavy traffic analysis for edf queues with reneging

Annals of Applied Probability

Volumn 21, Issue 2, 2011, Pages 484-545

  Kruk, Lukasz ^a   Lehoczky, John ^b   Ramanan, Kavita ^c   Shreve, Steven ^b  

^a MARIA CURIE SK ODOWSKA UNIVERSITY   (Poland)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c BROWN UNIVERSITY   (United States)

Author keywords

Diffusion limits; Due dates; Heavy traffic; Queueing; Random measures; Real time queues; Reneging

Indexed keywords

EID: 79953274489     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/10-AAP681     Document Type: Article

References (37)

1. ASMUSSEN, S. (2003). Applied Probability and Queues, 2nd ed. Applications of Mathematics (New York) 51. Springer, New York. MR1978607
2. BILLINGSLEY, P. (1999). Convergence of Probability Measures, 2nd ed. Wiley, New York. MR1700749
3. BOOTS, N. and TIJMS, H. (1999). A multiserver queueing system with impatient customers. Management Science 45 444-448.
4. CHEN, H. and MANDELBAUM, A. (1991). Stochastic discrete flow networks: Diffusion approximations and bottlenecks. Ann. Probab. 19 1463-1519. MR1127712
5. DECREUSEFOND, L. andMOYAL, P. (2008). Fluid limit of a heavily loaded EDF queue with impatient customers. Markov Process. Related Fields 14 131-158. MR2433299
6. DOWN, D., GROMOLL, H. C. and PUHA, A. (2009). Fluid limits for shortest remaining processing time queues. Math. Operations Research 4 880-911.
7. DOYTCHINOV, B., LEHOCZKY, J. and SHREVE, S. (2001). Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11 332-378. MR1843049
8. DUPUIS, P. and RAMANAN, K. (1999). Convex duality and the Skorokhod problem. Probab. Theory Related Fields 115 197-236.
9. ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York. MR838085
10. GAMARNIK, D. and ZEEVI, A. (2006). Validity of heavy traffic steady-state approximation in generalized Jackson networks. Ann. Appl. Probab. 16 56-90. MR2209336 (Pubitemid 43535927)
11. GROMOLL, H. C. (2004). Diffusion approximation for a processor sharing queue in heavy traffic. Ann. Appl. Probab. 14 555-611. MR2052895
12. GROMOLL, H. C. andKRUK, Ł. (2007). Heavy traffic limit for a processor sharing queue with soft deadlines. Ann. Appl. Probab. 17 1049-1101. MR2326240.
13. GROMOLL, H. C.,KRUK, L. and PUHA, A. Diffusion limits for shortest remaining processing time queues. Preprint, Dept. Mathematics, Univ. Virginia. Available at http://arxiv.org/ abs/1005.1035.
14. HARRISON, J. M. and REIMAN, M. Reflected Brownian motion in an orthant. Ann. Probab. 9 302-308.
15. HARRISON, J. M. (1985). Brownian Motion and Stochastic Flow Systems. Wiley, New York. MR798279
16. IGLEHART, D. L. andWHITT, W. (1970). Multiple channel queues in heavy traffic. I. Adv. in Appl. Probab. 2 150-177. MR0266331
17. KARATZAS, I. and SHREVE, S. E. (1988). Brownian Motion and Stochastic Calculus. Graduate Texts in Mathematics 113. Springer, New York. MR917065
18. KASPI, H. and RAMANAN, K. (2011). Law of large numbers limits for many-server queues. Ann. Appl. Probab. 21 33-114.
19. KINGMAN, J. F. C. (1961). The single server queue in heavy traffic. Proc. Cambridge Philos. Soc. 57 902-904. MR0131298
20. KINGMAN, J. F. C. (1962). On queues in heavy traffic. J. Roy. Statist. Soc. Ser. B 24 383-392. MR0148146
21. KRUK, Ł. (2007). Diffusion approximation for a G/G/1 EDF queue with unbounded lead times. Ann. Univ. Mariae Curie-Sk?odowska Math. A 61 51-90.
22. KRUK, Ł., LEHOCZKY, J. P. and SHREVE, S. (2003). Second order approximation for the customer time in queue distribution under the FIFO service discipline. Ann. Univ. Mariae Curie-Skodowska Sect. AI Inform. 1 37-48. MR2254131
23. KRUK, Ł., LEHOCZKY, J. P., SHREVE, S. and YEUNG, S.-N. (2004). Earliest-deadline-first service in heavy-traffic acyclic networks. Ann. Appl. Probab. 14 1306-1352. MR2071425 (Pubitemid 41449220)
24. KRUK, Ł., LEHOCZKY, J. P. and SHREVE, S. (2006). Accuracy of state space collapse for earliest-deadline-first queues. Ann. Appl. Probab. 16 516-561. MR2244424 (Pubitemid 44196524)
25. KRUK, Ł., LEHOCZKY, J. P., RAMANAN, K. and SHREVE, S. E. (2007). An explicit formula for the Skorokhod map on [0, a]. Ann. Probab. 35 1740-1768.
26. KRUK, Ł., LEHOCZKY, J. P., RAMANAN, K. and SHREVE, S. (2008). Double Skorokhod map and reneging real-time queues. In Markov Processes and Related Topics: A Festschrift for Thomas G. Kurtz. Inst. Math. Stat. Collect. 4 169-193. IMS, Beachwood, OH. MR2574231
27. LEHOCZKY, J. P. (1996). Real-time queueing theory. In Proc. of IEEE Real-Time Systems Symposium 186-195. IEEE Computer Society Press, Los Alamitos, CA.
28. LIMIC, V. (2000). On the behavior of LIFO preemptive resume queues in heavy traffic. Electron. Comm. Probab. 5 13-27 (electronic). MR1736721
29. PANWAR, S. S. and TOWSLEY, D. (1992). Optimality of the stochastic earliest deadline policy for the G/M/c queue serving customers with deadlines. In Second ORSA Telecommunications Conference. ORSA (Operations Research Society of America), Baltimore, MD.
30. PROKHOROV, Y. (1956). Convergence of random processes and limit theorems in probability theory. Theory Probab. Appl. 1 157-214.
31. RAMANAN, K. and REIMAN, M. I. (2003). Fluid and heavy traffic diffusion limits for a generalized processor sharing model. Ann. Appl. Probab. 13 100-139. MR1951995.
32. ROSS, S. M. (1983). Stochastic Processes. Wiley, New York. MR683455
33. WARD, A. R. and GLYNN, P. W. (2003). A diffusion approximation for a Markovian queue with reneging. Queueing Syst. 43 103-128. MR1957808
34. WARD, A. R. and GLYNN, P. W. (2005). A diffusion approximation for a GI/GI/1 queue with balking or reneging. Queueing Syst. 50 371-400. MR2172907. (Pubitemid 41312620)
35. WHITT, W. (1971).Weak convergence theorems for priority queues: Preemptive-resume discipline. J. Appl. Probab. 8 74-94. MR0307389
36. WHITT, W. (2002). Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer, New York. MR1876437
37. ZHANG, J. and ZWART, B. (2008). Steady state approximations of limited processor sharing queues in heavy traffic. Queueing Syst. 60 227-246. MR2461617