Heavy traffic analysis for EDF queues with reneging
Łukasz Kruk, John Lehoczky, Kavita Ramanan, and Steven Shreve
Source: Ann. Appl. Probab. Volume 21, Number 2
(2011), 484-545.
Abstract
This paper presents a heavy-traffic analysis of the behavior of a single-server queue under an Earliest-Deadline-First (EDF) scheduling policy in which customers have deadlines and are served only until their deadlines elapse. The performance of the system is measured by the fraction of reneged work (the residual work lost due to elapsed deadlines) which is shown to be minimized by the EDF policy. The evolution of the lead time distribution of customers in queue is described by a measure-valued process. The heavy traffic limit of this (properly scaled) process is shown to be a deterministic function of the limit of the scaled workload process which, in turn, is identified to be a doubly reflected Brownian motion. This paper complements previous work by Doytchinov, Lehoczky and Shreve on the EDF discipline in which customers are served to completion even after their deadlines elapse. The fraction of reneged work in a heavily loaded system and the fraction of late work in the corresponding system without reneging are compared using explicit formulas based on the heavy traffic approximations. The formulas are validated by simulation results.
First Page:
Show
Hide
Keywords: Due dates; heavy traffic; queueing; reneging; diffusion limits; random measures; real-time queues
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.aoap/1300800980
Digital Object Identifier: doi:10.1214/10-AAP681
Zentralblatt MATH identifier: 05886809
Mathematical Reviews number (MathSciNet): MR2807965
References
[1] Asmussen, S. (2003). Applied Probability and Queues, 2nd ed. Applications of Mathematics (New York) 51. Springer, New York.
Mathematical Reviews (MathSciNet): MR1978607
[2] Billingsley, P. (1999). Convergence of Probability Measures, 2nd ed. Wiley, New York.
Mathematical Reviews (MathSciNet): 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.
Mathematical Reviews (MathSciNet): MR1127712
Zentralblatt MATH: 0757.60094
Digital Object Identifier: doi:10.1214/aop/1176990220
Project Euclid: euclid.aop/1176990220
[5] Decreusefond, L. and Moyal, P. (2008). Fluid limit of a heavily loaded EDF queue with impatient customers. Markov Process. Related Fields 14 131–158.
Mathematical Reviews (MathSciNet): MR2433299
Zentralblatt MATH: 1154.60072
[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.
Mathematical Reviews (MathSciNet): MR1843049
Zentralblatt MATH: 1015.60086
Digital Object Identifier: doi:10.1214/aoap/1015345295
Project Euclid: euclid.aoap/1015345295
[8] Dupuis, P. and Ramanan, K. (1999). Convex duality and the Skorokhod problem. Probab. Theory Related Fields 115 197–236.
Mathematical Reviews (MathSciNet): MR1720348
Digital Object Identifier: doi:10.1007/s004400050269
[9] Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
Mathematical Reviews (MathSciNet): 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.
Mathematical Reviews (MathSciNet): MR2209336
Digital Object Identifier: doi:10.1214/105051605000000638
Project Euclid: euclid.aoap/1141654281
[11] Gromoll, H. C. (2004). Diffusion approximation for a processor sharing queue in heavy traffic. Ann. Appl. Probab. 14 555–611.
Mathematical Reviews (MathSciNet): MR2052895
Zentralblatt MATH: 1050.60085
Digital Object Identifier: doi:10.1214/105051604000000035
Project Euclid: euclid.aoap/1082737104
[12] Gromoll, H. C. and Kruk, Ł. (2007). Heavy traffic limit for a processor sharing queue with soft deadlines. Ann. Appl. Probab. 17 1049–1101.
Mathematical Reviews (MathSciNet): MR2326240
Zentralblatt MATH: 1130.60087
Digital Object Identifier: doi:10.1214/105051607000000014
Project Euclid: euclid.aoap/1179839182
[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.
Mathematical Reviews (MathSciNet): MR798279
[16] Iglehart, D. L. and Whitt, W. (1970). Multiple channel queues in heavy traffic. I. Adv. in Appl. Probab. 2 150–177.
Mathematical Reviews (MathSciNet): MR266331
Zentralblatt MATH: 0218.60098
Digital Object Identifier: doi:10.2307/3518347
JSTOR: links.jstor.org
[17] Karatzas, I. and Shreve, S. E. (1988). Brownian Motion and Stochastic Calculus. Graduate Texts in Mathematics 113. Springer, New York.
Mathematical Reviews (MathSciNet): 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.
Mathematical Reviews (MathSciNet): MR131298
Digital Object Identifier: doi:10.1017/S0305004100036094
[20] Kingman, J. F. C. (1962). On queues in heavy traffic. J. Roy. Statist. Soc. Ser. B 24 383–392.
Mathematical Reviews (MathSciNet): MR148146
JSTOR: links.jstor.org
[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-Skłodowska Sect. AI Inform. 1 37–48.
Mathematical Reviews (MathSciNet): 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.
Mathematical Reviews (MathSciNet): MR2071425
Zentralblatt MATH: 1084.60056
Digital Object Identifier: doi:10.1214/105051604000000314
Project Euclid: euclid.aoap/1089736287
[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.
Mathematical Reviews (MathSciNet): MR2244424
Zentralblatt MATH: 1129.60084
Digital Object Identifier: doi:10.1214/105051605000000809
Project Euclid: euclid.aoap/1151592242
[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.
Mathematical Reviews (MathSciNet): MR2349573
Zentralblatt MATH: 1139.60017
Digital Object Identifier: doi:10.1214/009117906000000890
Project Euclid: euclid.aop/1189000926
[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.
Mathematical Reviews (MathSciNet): MR2574231
Zentralblatt MATH: 1170.60314
Digital Object Identifier: doi:10.1214/074921708000000372
[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).
Mathematical Reviews (MathSciNet): MR1736721
Zentralblatt MATH: 0955.60097
[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.
Mathematical Reviews (MathSciNet): MR84896
[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.
Mathematical Reviews (MathSciNet): MR1951995
Zentralblatt MATH: 1016.60083
Digital Object Identifier: doi:10.1214/aoap/1042765664
Project Euclid: euclid.aoap/1042765664
[32] Ross, S. M. (1983). Stochastic Processes. Wiley, New York.
Mathematical Reviews (MathSciNet): MR683455
[33] Ward, A. R. and Glynn, P. W. (2003). A diffusion approximation for a Markovian queue with reneging. Queueing Syst. 43 103–128.
Mathematical Reviews (MathSciNet): MR1957808
Digital Object Identifier: doi:10.1023/A:1021804515162
[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.
Mathematical Reviews (MathSciNet): MR2172907
Digital Object Identifier: doi:10.1007/s11134-005-3282-3
[35] Whitt, W. (1971). Weak convergence theorems for priority queues: Preemptive-resume discipline. J. Appl. Probab. 8 74–94.
Mathematical Reviews (MathSciNet): MR307389
Zentralblatt MATH: 0215.53801
Digital Object Identifier: doi:10.2307/3211839
JSTOR: links.jstor.org
[36] Whitt, W. (2002). Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer, New York.
Mathematical Reviews (MathSciNet): MR1876437
Zentralblatt MATH: 0993.60001
[37] Zhang, J. and Zwart, B. (2008). Steady state approximations of limited processor sharing queues in heavy traffic. Queueing Syst. 60 227–246.
Mathematical Reviews (MathSciNet): MR2461617
Digital Object Identifier: doi:10.1007/s11134-008-9095-4
The Annals of Applied Probability
