Sojourn times in the M/PH/1 processor sharing queue

Queueing Systems

Volumn 50, Issue 1, 2005, Pages 109-130

  Sericola, Bruno ^a   Guillemin, Fabrice ^b   Boyer, Jacqueline ^b  

^a CAMPUS DE BEAULIEU   (France)

^b ORANGE LABS   (France)

Author keywords

Asymptotic estimates; Phase type distribution; Processor sharing discipline; Sojourn time

Indexed keywords

APPROXIMATION ALGORITHMS; DIFFERENTIAL EQUATIONS; PH; QUEUEING THEORY;

ASYMPTOTIC ESTIMATES; DIFFERENTIAL SYSTEMS; DISTRIBUTED SERVICE; PHASE TYPE DISTRIBUTIONS; PROCESSOR SHARING; PROCESSOR SHARING QUEUE; SOJOURN TIME; SOJOURN TIME DISTRIBUTIONS;

POISSON DISTRIBUTION;

EID: 21644435687     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-005-0372-1     Document Type: Article

References (25)

1. J. Abate and W. Whitt, Numerical inversion of Laplace transforms of probability distributions, ORSA J.Comput. 7(1) (1995) 36-43.
2. K. Agrawal, A.M. Makowski, and P. Nain, On a reduced load equivalence for fluid queues under subexponentiality, Queueing Systems. Theory and Applications 33(1-3) (1999) 5-41.
3. S. Asmussen, Applied Probability and Queues (J. Wiley and Sons, 1987).
4. C. Barakat, P. Thiran, G. Iannaccone, C. Diot and P. Owezarski, Modeling internet backbone traffic at the flow level, level Transactions on Signal Processing - Special Issue on Signal Processing in Networking 51(8) (2003) 2111-2124.
5. S. Ben Fredj, T. Bonald, A. Proutiêre, G. Régnié and J.W. Roberts, Statistical bandwidth sharing: a study of congestion at now level, in: Proc. SIGCOMM 2001, (San Diego, CA, USA, Aug. 2001).
6. S.C. Borst, O.J. Boxma, J.A. Morrison and R. Núñez-Queija, The equivalence between processor sharing and service in random order, Oper. Res. Lett 31 (2003) 254-262.
7. K. Claffy, G. Miller and K. Thompson, The nature of the beast: Recent traffic measurements from an Internet backbone, in: Internet Society INET'98, (1998).
8. E.G. Coffman, R.R. Muntz and H. Trotter, Waiting time distributions for processor-sharing systems, J. ACM 17 (1970) 123-130.
9. L. Flatto, The waiting time distribution for the random order service M/ M/1 queue, Annals of Applied Probability 7 (1997) 382-409.
10. F. Guillemin and J. Boyer, Analysis of the M/M/1 queue with processor sharing via spectral theory, Queueing Systems 39 (2001) 377-397.
11. F. Guillemin, P. Robert and D. Zwart, Tail asymptotics for processor sharing queues, Annals of Applied Probability 36 (2004) 1-19.
12. P. Jelenković and P. Momčilović, Large deviation analysis of subexponential waiting time in an M/ G/1 PS queue (2001). http://comet.ctr.columbia.edu/~petar/ps.pdf. Submitted.
13. M. Yu. Kitaev, The M/G/1 processor-sharing model: Transient behavior, Queueing Systems 14 (1993) 239-273.
14. L. Kleinrock, Queueing Systems (J. Wiley, New-York), 1976.
15. J. Morrison, Response time for a processor-sharing system, SIAM J. Appl. Math. 45(1) (1985) 152-167.
16. R. Núñez.-Queija, Processor Sharing Models for Integrated Services Networks, PhD thesis, Eindhoven University of Technology (2000).
17. T. Ott, The sojourn-time distribution in the M/G/1 queue with processor sharing, J. Appl. Prob. 21 (1984) 360-378.
18. F. Pollaczek, La loi d'attente des appels téléphoniques. C.R. Acad. Sci. 222 (1946) 353-355.
19. J. Riordan, Stochastic Service Systems (John Wiley and Sons, Inc., New York London, 1962).
20. J. Roberts and L. Massoulié, Bandwidth sharing and admission control for elastic traffic, in Proc. Infocom'99 (1998).
21. S.M. Ross, Average delay in queues with non-stationary Poisson arrivals, J. Appl. Probab. 15 (1978) 602-609.
22. D. Starobinski and M. Sidi, Modeling and analysis of heavy-tailed distributions via classical teletraffic methods, Queueing Systems 36(1-3) (2000) 243-267.
23. J.L. van den Derg and O.J. Boxma, The M/G/l queue with processor sharing and its relation to a feedback queue, Queueing Systems 9 (1991) 365-402.
24. S.K Yashkov, Processor sharing queues: some progress in analysis, Queueing System 2 (1987) 1-17.
25. A.P. Zwart and O.J. Boxma, Sojourn time asymptotics in the M/G/1 processor sharing queue, Queueing Systems Theory Appl. 35(1-4) (2000) 141-166.