The fluid limit of a heavily loaded processor sharing queue

Annals of Applied Probability

Volumn 12, Issue 3, 2002, Pages 797-859

  Gromoll, H Christian ^a   Puha, Amber L ^b   Williams, Ruth J ^c  

^a EURANDOM   (Netherlands)

^b CALIFORNIA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Fluid model; Heavy traffic; Measure valued process; Processor sharing queue; Renewal equation

Indexed keywords

EID: 0036392198     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1031863171     Document Type: Article

References (21)

1. BACCELLI, F. and TOWSLEY, D. (1990). The customer response times in the processor sharing queue are associated. Queueing Systems Theory Appl. 7 269-282.
2. BILLINGSLEY, P. (1968). Convergence of Probability Measures. Wiley, New York.
3. BRAMSON, M. (1996). Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Systems Theory Appl. 22 5-45.
4. BRAMSON, M. (1997). Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks. Queueing Systems Theory Appl. 23 1-26.
5. BRAMSON, M. (1998). State space collapse with applications to heavy traffic limits for multiclass queueing networks. Queueing Systems Theory Appl. 30 89-148.
6. CHEN, H., KELLA, O. and WEISS, G. (1997). Fluid approximations for a processor-sharing queue. Queueing Systems Theory Appl. 27 99-125.
7. DAWSON, D. A. (1993). Measure Valued Markov Processes. École d'Été de Probabilités de Saint-Flour XXI. Lecture Notes in Math 1541. Springer, Berlin.
8. 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-377.
9. DURRETT, R. T. (1996). Probability: Theory and Examples, 2nd ed. Duxbury Press, Belmont.
10. ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
11. FELLER, W. (1971). An Introduction to Probability Theory and Its Applications 2, 2nd ed. Wiley, New York.
12. GRISHECHKIN, S. (1994). GI/G/1 processor sharing queue in heavy traffic. Adv. in Appl. Probab. 26 539-555.
13. GROMOLL, H. C. Diffusion approximation for a processor sharing queue in heavy traffic. Preprint.
14. IGLEHART, D. L. and WHITT, W. (1970). Multiple channel queues in heavy traffic I. Adv. in Appl. Probab. 2 150-177.
15. JEAN-MARIE, A. and ROBERT, P. (1994). On the transient behavior of the processor sharing queue. Queueing Systems Theory Appl. 17 129-136.
16. KALLENBERG, O. (1983). Random Measures. Academic Press, New York.
17. PROHOROV, Yu. V. (1956). Convergence of random processes and limit theorems in probability theory. Theory Probab. Appl. 1 157-214.
18. PUHA, A. L., STOLYAR, A. L. and WILLIAMS, R. J. The fluid limit of an overloaded processor sharing queue. Preprint.
19. PUHA, A. L. and WILLIAMS, R. J. Invariant states and rates of convergence for a critical fluid model of a processor sharing queue. Preprint.
20. WILLIAMS, R. J. (1998). Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse. Queueing Systems Theory Appl. 30 27-88.
21. YASHKOV, S. F. (1987). Processor-sharing queues: some progress in analysis. Queueing Systems Theory Appl. 2 1-17.