The fluid limit of an overloaded processor sharing queue

Mathematics of Operations Research

Volumn 31, Issue 2, 2006, Pages 316-350

  Puha, Amber L ^a   Stolyar, Alexander L ^b   Williams, Ruth J ^c  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Continuity in initial conditions; Invariant shape; Measure valued process; Order preservation; Overloaded processor sharing queue; Renewal equations; Supercritical fluid models

Indexed keywords

APPROXIMATION THEORY; INVARIANCE; PROGRAM PROCESSORS; QUEUEING THEORY; SUPERCRITICAL FLUIDS;

CONTINUITY IN INITIAL CONDITIONS; INVARIANT SHAPE; MEASURE-VALUED PROCESS; ORDER PRESERVATION; OVERLOADED PROCESSOR SHARING QUEUE; RENEWAL EQUATIONS; SUPERCRITICAL FLUID MODELS;

OPERATIONS RESEARCH;

EID: 33748415199     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1050.0181     Document Type: Article

References (17)

1. Billingsley, P. 1968. Convergence of Probability Measures. John Wiley & Sons, Inc., New York.
2. Chen, H., O. Kella, G. Weiss. 1997. Fluid approximations for a processor-sharing queue. Queueing Systems: Theory Appl. 27 99-125.
3. Doytchinov, B., J. Lehoczky, S. Shreve. 2001. Real-time queues in heavy traffic with earliest-deadline-first-queue discipline. Ann. Appl. Probab. 11 332-378.
4. Durrett, R. T. 1996. Probability: Theory and Examples, 2nd ed. Duxbury Press, Belmont, CA.
5. Ethier, S. N., T. G. Kurtz. 1986. Markov Processes: Characterization and Convergence. John Wiley & Sons, Inc., New York.
6. Feller, W. 1971. An Introduction to Probability Theory and its Applications, Vol. 2, 2nd ed. John Wiley & Sons, Inc., New York.
7. Grishechkin, S. 1994. GI/G/1 processor sharing queue in heavy traffic. Adv. Appl. Probab. 26 539-555.
8. Gromoll, H. C. 2004. Diffusion approximation for a processor sharing queue in heavy traffic. Ann. Appl. Probab. 14 555-611.
9. Gromoll, H. C., A. L. Puha, R. J. Williams. 2002. The fluid limit of a heavily loaded processor sharing queue. Ann. Appl. Probab. 12 797-859.
10. Jean-Marie, A., P. Robert. 1994. On the transient behavior of the processor sharing queue. Queueing Systems: Theory Appl. 17 129-136.
11. Kallenberg, O. 1983. Random Measures. Academic Press, New York.
12. Linz, P. 1985. Analytical and Numerical Methods for Volterra Equations, SIAM Studies in Applied Mathematics, Vol. 7. SIAM, Philadelphia, PA.
13. Mandjes, M., B. Zwart. Large deviations and importance sampling for sojourn times in processor sharing queues. Queueing Systems: Theory Appl. Forthcoming.
14. Prohorov, Yu V. 1956. Convergence of random processes and limit theorems in probability theory. Theory Probab. Appl. 1 157-214.
15. Puha, A. L., R. J. Williams. 2004. Invariant states and rates of convergence for the fluid limit of a heavily loaded processor sharing queue. Ann. Appl. Probab. 14 517-554.
16. Resnick, S. I. 1992. Adventures in Stochastic Processes. Birkhauser, Boston, MA.
17. Smith, J. M. 1989. Evolutionary Genetics. Oxford University Press, New York.