메뉴 건너뛰기




Volumn 17, Issue 3, 2007, Pages 1049-1101

Heavy traffic limit for a processor sharing queue with soft deadlines

Author keywords

Deadlines; Empirical process; Heavy traffic; Measure valued; Process; Processor sharing; Real time queue

Indexed keywords


EID: 52349118603     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/105051607000000014     Document Type: Article
Times cited : (16)

References (26)
  • 1
    • 52349097247 scopus 로고    scopus 로고
    • BILLINGSLEY, P. (1986). Probability and Measure, 2nd ed. Wiley, New York. MR0830424
    • BILLINGSLEY, P. (1986). Probability and Measure, 2nd ed. Wiley, New York. MR0830424
  • 2
    • 52349086395 scopus 로고    scopus 로고
    • BILLINGSLEY, P. (1999). Convergence of Probability Measures, 2nd ed. Wiley, New York. MR1700749
    • BILLINGSLEY, P. (1999). Convergence of Probability Measures, 2nd ed. Wiley, New York. MR1700749
  • 3
    • 0032262849 scopus 로고    scopus 로고
    • State space collapse with applications to heavy traffic limits for multi-class queueing networks
    • MR1663763
    • BRAMSON, M. (1998). State space collapse with applications to heavy traffic limits for multi-class queueing networks. Queueing Syst. 30 89-148. MR1663763
    • (1998) Queueing Syst , vol.30 , pp. 89-148
    • BRAMSON, M.1
  • 4
    • 0035540275 scopus 로고    scopus 로고
    • Stability of earliest-due-date, first-served queueing networks
    • MR1865459
    • BRAMSON, M. (2001). Stability of earliest-due-date, first-served queueing networks. Queueing Syst. 39 79-102. MR1865459
    • (2001) Queueing Syst , vol.39 , pp. 79-102
    • BRAMSON, M.1
  • 5
    • 0035626682 scopus 로고    scopus 로고
    • Heavy traffic limits for some queueing networks
    • MR1825460
    • BRAMSON, M. and DAI, J. (2001). Heavy traffic limits for some queueing networks. Ann. Appl. Probab. 11 49-90. MR1825460
    • (2001) Ann. Appl. Probab , vol.11 , pp. 49-90
    • BRAMSON, M.1    DAI, J.2
  • 6
    • 0035538458 scopus 로고    scopus 로고
    • Real-time queues in heavy traffic with earliest-deadline-first queue discipline
    • MR1843049
    • 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
    • (2001) Ann. Appl. Probab , vol.11 , pp. 332-378
    • DOYTCHINOV, B.1    LEHOCZKY, J.2    SHREVE, S.3
  • 7
    • 52349097014 scopus 로고    scopus 로고
    • ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York. MR0838085
    • ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York. MR0838085
  • 8
    • 0000169344 scopus 로고
    • GI/G/1 processor sharing queue in heavy traffic
    • MR1272726
    • GRISHECHKIN, S. (1994). GI/G/1 processor sharing queue in heavy traffic. Adv. in Appl. Probab. 26 539-555. MR1272726
    • (1994) Adv. in Appl. Probab , vol.26 , pp. 539-555
    • GRISHECHKIN, S.1
  • 9
    • 18844394130 scopus 로고    scopus 로고
    • Diffusion approximation for a processor sharing queue in heavy traffic
    • MR2052895
    • GROMOLL, H. C. (2004). Diffusion approximation for a processor sharing queue in heavy traffic. Ann. Appl. Probab. 14 555-611. MR2052895
    • (2004) Ann. Appl. Probab , vol.14 , pp. 555-611
    • GROMOLL, H.C.1
  • 10
    • 0036392198 scopus 로고    scopus 로고
    • The fluid limit of a heavily loaded processor sharing queue
    • MR1925442
    • GROMOLL, H. C., PUHA, A. L. and WILLIAMS, R. J. (2002). The fluid limit of a heavily loaded processor sharing queue. Ann. Appl. Probab. 12 797-859. MR1925442
    • (2002) Ann. Appl. Probab , vol.12 , pp. 797-859
    • GROMOLL, H.C.1    PUHA, A.L.2    WILLIAMS, R.J.3
  • 11
    • 0014756893 scopus 로고
    • Multiple channel queues in heavy traffic I
    • MR0266331
    • IGLEHART, D. L. and WHITT, W. (1970). Multiple channel queues in heavy traffic I. Adv. in Appl. Probab. 2 150-177. MR0266331
    • (1970) Adv. in Appl. Probab , vol.2 , pp. 150-177
    • IGLEHART, D.L.1    WHITT, W.2
  • 12
    • 52349116668 scopus 로고    scopus 로고
    • KALLENBERG, O. (1986). Random Measures. Academic Press, New York. MR0854102
    • KALLENBERG, O. (1986). Random Measures. Academic Press, New York. MR0854102
  • 13
    • 52349103669 scopus 로고    scopus 로고
    • KRUK, Ł., LEHOCZKY, J. 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. MR2254131
    • KRUK, Ł., LEHOCZKY, J. 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. MR2254131
  • 14
    • 33746862610 scopus 로고    scopus 로고
    • Accuracy of state space collapse for earliest-deadline-first queues
    • MR2244424
    • KRUK, Ł., LEHOCZKY, J. and SHREVE, S. (2006). Accuracy of state space collapse for earliest-deadline-first queues. Ann Appl. Probab. 16 516-561. MR2244424
    • (2006) Ann Appl. Probab , vol.16 , pp. 516-561
    • KRUK, Ł.1    LEHOCZKY, J.2    SHREVE, S.3
  • 15
    • 0037274519 scopus 로고    scopus 로고
    • Multiple-input heavy-traffic real-time queues
    • MR1951994
    • KRUK, Ł., LEHOCZKY, J., SHREVE, S. and YEUNG, S.-N. (2003). Multiple-input heavy-traffic real-time queues. Ann. Appl. Probab. 13 54-99. MR1951994
    • (2003) Ann. Appl. Probab , vol.13 , pp. 54-99
    • KRUK, Ł.1    LEHOCZKY, J.2    SHREVE, S.3    YEUNG, S.-N.4
  • 16
    • 6944238857 scopus 로고    scopus 로고
    • Earliest-deadline-first service in heavy-traffic acyclic networks
    • MR2071425
    • KRUK, Ł., LEHOCZKY, J., SHREVE, S. and YEUNG, S.-N. (2004). Earliest-deadline-first service in heavy-traffic acyclic networks. Ann. Appl. Probab. 14 1306-1352. MR2071425
    • (2004) Ann. Appl. Probab , vol.14 , pp. 1306-1352
    • KRUK, Ł.1    LEHOCZKY, J.2    SHREVE, S.3    YEUNG, S.-N.4
  • 17
    • 23944462090 scopus 로고
    • On tightness of randomly indexed sequences of random variables
    • MR1811853
    • KRUK, Ł. and ZIEBA, W. (1994). On tightness of randomly indexed sequences of random variables. Bull. Pol. Acad. Sci. Math. 42 237-241. MR1811853
    • (1994) Bull. Pol. Acad. Sci. Math , vol.42 , pp. 237-241
    • KRUK, Ł.1    ZIEBA, W.2
  • 19
    • 0000033355 scopus 로고
    • Convergence of random processes and limit theorems in probability theory
    • MR0084896
    • PROHOROV, Y. V. (1956). Convergence of random processes and limit theorems in probability theory. Theory Probab. Appl. 1 157-214. MR0084896
    • (1956) Theory Probab. Appl , vol.1 , pp. 157-214
    • PROHOROV, Y.V.1
  • 20
    • 33748415199 scopus 로고    scopus 로고
    • The fluid limit of an overloaded processor sharing queue
    • MR2234000
    • PUHA, A. L., STOLYAR, A. L. and WILLIAMS, R. J. (2006). The fluid limit of an overloaded processor sharing queue. Math. Oper. Res. 31 316-350. MR2234000
    • (2006) Math. Oper. Res , vol.31 , pp. 316-350
    • PUHA, A.L.1    STOLYAR, A.L.2    WILLIAMS, R.J.3
  • 21
    • 26844433655 scopus 로고    scopus 로고
    • Invariant states and rates of convergence for a critical fluid model of a processor sharing queue
    • MR2052894
    • PUHA, A. L. and WILLIAMS, R. J. (2004). Invariant states and rates of convergence for a critical fluid model of a processor sharing queue. Ann. Appl. Probab. 14 517-554. MR2052894
    • (2004) Ann. Appl. Probab , vol.14 , pp. 517-554
    • PUHA, A.L.1    WILLIAMS, R.J.2
  • 22
    • 0021481522 scopus 로고
    • Open queueing networks in heavy traffic
    • MR0757317
    • REIMAN, M. I. (1984). Open queueing networks in heavy traffic. Math. Oper. Res. 9 441-458. MR0757317
    • (1984) Math. Oper. Res , vol.9 , pp. 441-458
    • REIMAN, M.I.1
  • 23
    • 52349110760 scopus 로고    scopus 로고
    • VAN DER VAART, A. and WELLNER, J. A. (1996). Weak convergence and empirical processes. Springer, New York. MR1385671
    • VAN DER VAART, A. and WELLNER, J. A. (1996). Weak convergence and empirical processes. Springer, New York. MR1385671
  • 24
    • 0032262848 scopus 로고    scopus 로고
    • Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
    • MR1663759
    • WILLIAMS, R. J. (1998). Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Syst. 30 27-88. MR1663759
    • (1998) Queueing Syst , vol.30 , pp. 27-88
    • WILLIAMS, R.J.1
  • 25
    • 0001775785 scopus 로고
    • Processor-sharing queues: Some progress in analysis
    • MR0903424
    • YASHKOV, S. F. (1987). Processor-sharing queues: Some progress in analysis. Queueing Syst. 2 1-17. MR0903424
    • (1987) Queueing Syst , vol.2 , pp. 1-17
    • YASHKOV, S.F.1
  • 26
    • 85040704846 scopus 로고    scopus 로고
    • Real-time queueing networks in heavy traffic with EDF and FIFO queue discipline
    • Preprint
    • YEUNG, S.-N. and LEHOCZKY, J. P. (2004). Real-time queueing networks in heavy traffic with EDF and FIFO queue discipline. Preprint.
    • (2004)
    • YEUNG, S.-N.1    LEHOCZKY, J.P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.