Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue

Queueing Systems

Volumn 53, Issue 1-2, 2006, Pages 7-18

  Cheung, Sing Kong ^a   Van Berg, Hans Den ^a   Boucherie, Richard J ^a,b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b TNO   (Netherlands)

Author keywords

Conditional sojourn time; Euler's number triangle; Insensitive bounds; Instantaneous sojourn time; M G 1 PS; Moment ordering; Moments; Permanent customers

Indexed keywords

GEOMETRY; STOCHASTIC SYSTEMS;

CONDITIONAL SOJOURN TIME; EULER'S NUMBER TRIANGLE; INSENSITIVE BOUNDS; MOMENTS; PERMANENT CUSTOMERS; SOJOURN TIME;

QUEUEING THEORY;

EID: 33646699827     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-006-7583-y     Document Type: Article

References (36)

1. B.K. Asare and F.G. Foster. Conditional response times in the M/G/1 processor-sharing system, Journal of Applied Probability 20 (1983) 910-915.
2. S. Ben Fredj, T. Bonald, A. Proutière, G. Régnié, and J.W. Roberts, Statistical bandwidth sharing: A study of congestion at flow level, in: Proceedings ACM SIGCOMM'01 (2001) pp. 111-122.
3. J.L. van den Berg, Sojourn Times in Feedback and Processor Sharing Queues, Ph.D. thesis, Utrecht University. The Netherlands (1990).
4. J.L. van den Berg and O.J. Boxma, The M/G/1 queue with processor sharing and its relation to a feedback queue, Queueing Systems 9 (1991) 365-402.
5. A. Bhattacharjee and D. Sengupta, On the coefficient of variation of the C- and C-classes, Statistics Probability Letters 27 (1996) 177-180.
6. L. Carlitz, Eulerian numbers and polynomials of higherorder, Duke Mathematical Journal 27 (1960) 401-423.
7. S.-K. Cheung, J.L. van den Berg, and R.J. Boucherie, Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues, Performance Evaluation 62(1-4) (2005) 100-116.
8. J.W. Cohen, The multiple phase service network with generalized processor sharing, Acta Informatica 12 (1979) 245-284.
9. F. Delcoigne, A. Proutière, and G. Régnié, Modeling integration of streaming and data traffic, Performance Evaluation 55(3-4) (2004) 185-209.
10. R.L. Graham, D.E. Knuth, and O. Patashnik, Eulerian Numbers, §6.2 in Concrete Mathematics: A Foundation for Computer Science, 2nd ed. (Reading, MA. Addison-Wesley, 1994) pp. 267-272.
11. S. Grishechkin, On a relationship between processor-sharing queues and Cmmp-Mode-Jagers branching processes, Advances in Applied Probability 24 (1992) 653-698.
12. Y. Kitayev, The M/G/1 processor-sharing model: Transient behavior, Queueing Systems 14 (1993) 239-273.
13. B. Klar, A note on the L-class of life distributions, Journal of Applied Probability 39 (2002), no. 1: 11-19.
14. B. Klefsjö, A useful ageing property based on Laplace transform, Journal of Applied Probability 20 (1983) 615-626.
15. L. Kleinrock, Analysis of a time-shared processor, Naval Research Logistics Quarterly 11 (1964) 59-73.
16. L. Kleinrock, Time-shared systems: A theoretical treatment, Journal of the Association for Computing Machinery 14 (1967) 242-261.
17. L. Kleinrock, Queueing Systems, Vol II: Computer Applications (Wiley, New York, 1976).
18. G. Lin, Characterizations of the L-class of life distributions, Statistics Probability Letters 40 (1998) 259-266.
19. R. Litjens, F. Roijers, J.L. van den Berg, R.J. Boucherie, and M. Fleuren, Analysis of flow transfer times, in IEEE 802.11 wireless LANs, Annals of Telecommunications 59(11-12) (2004) 1407-1432.
20. R. Núñez-Queija, Processor sharing models for integrated services networks, Ph.D. thesis, Eindhoven University of Technology, The Netherlands (2000).
21. T.J. Ott, The sojourn time distribution in the M/G/1 queue with processor sharing, Journal of Applied Probability 21 (1984) 360-378.
22. M. Sakata, S. Noguchi, and J. Oizumi, Analysis of a processor-shared queueing model for time-sharing systems, in: Proceedings 2nd Hawaii International Conference on System Sciences, Jan. (1969), pp. 625-628.
23. R. Schassberger, A new approach to the M/G/1 processor sharing queue, Advances in Applied Probability 16 (1984) 202-213.
24. L.R. Shenton and K.O. Bowman, The geometric distribution, cumulants, Eulerian numbers, and the logarithmic function, Far East Journal of Theoretical Statistics 5 (2001) 113-142.
25. L.R. Shenton and K.O. Bowman, The geometric distribution's central moments and Eulerian numbers of the second kind, Far East Journal of Theoretical Statistics 7 (2002) 1-17.
26. M. Shaked and J.G. Shanthikumar, Stochastic Orders and Their Applications (Academic Press Inc., 1994).
27. D. Stoyan, Comparison Methods for Queues and Other Stochastic-Models (Wiley, Chichester, 1983).
28. Weisstein, W. Eric, Eulerian Number, From MathWorld - A Wolfram Web Resource. http://mathworld.wolfram.com/EulerianNumber.html
29. A. Ward and W. Whitt, Predicting response times in processor-sharing queues, in: P.W. Glynn, D.J. MacDonald and S.J. Turner (eds.), Proceedings of the Fields Institute Conference on Communication Networks, 2000.
30. W. Whitt, The M/G/1 processor-sharing queue with long and short jobs. Unpublished manuscript (1998).
31. S.F. Yashkov, A derivation of response time distribution for a M/G/1 processor-sharing queue, Problems of Control and Information Theory 12 (1983) 133-148.
32. S.F. Yashkov Processor-sharing queues: Some progress in analysis, Queueing Systems 2 (1987) 1-17.
33. S.F. Yashkov, Mathematical problems in the theoiy of processor-sharing queueing systems, Journal of Soviet Mathematics 58 (1992) 101-147.
34. S.F. Yashkov, On a heavy traffic limit theorem for the M/G/1 processor sharing queue, Communications in Statistics-Stochastic Models 9(3) (1993) 467-471.
35. A.P. Zwart and O.J. Boxma, Sojourn time asymptotics in the M/G/1 processor sharing queue, Queueing Systems 35 (2000) 141-166.
36. A.P. Zwart, Queueing systems with heavy tails, Ph.D. thesis, Eindhoven University of Technology, The Netherlands (2001).