A sample path relation for the sojourn times in G/G/1 - PS systems and its applications

Queueing Systems

Volumn 52, Issue 4, 2006, Pages 281-286

  Brandt, Andreas ^a   Brandt, Manfred ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Busy period; Comparative analysis; First come first served; G D 1; G G 1; G GI 1; Mean sojourn time approximation; Processor sharing; Sample path; Sojourn time; Waiting time

Indexed keywords

BUSY PERIOD; COMPARATIVE ANALYSIS; FIRST COME FIRST SERVED; G/D/1; G/G/1; G/GI/1; MEAN SOJOURN TIME; PROCESSOR SHARING; SAMPLE PATH; SOJOURN TIME; WAITING-TIME;

EID: 33646539103     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-006-6264-1     Document Type: Article

References (20)

1. F. Baccelli and P. Brémaud, Elements of Queueing Theory. Applications of Mathematics 26, (Springer-Verlag, Berlin, 2003).
2. F. Baccelli and D. Towsley, The customer response times in the processor sharing queue are associated, Queueing Systems 7 (1990) 269-282.
3. N. Bansal, Analysis of the M/G/1 processor-sharing queue with bulk arrivals, Oper. Res. Lett. 31 (2003) 401-405.
4. S. Borst, O. Boxma, and P. Jelenković, Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows, Queueing Systems 43 (2003) 273-306.
5. A. Brandt and M. Brandt, On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers, Math. Methods Oper. Res. 47 (1998) 181-220.
6. A. Brandt and M. Brandt, A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers, Queueing Systems 32 (1999) 363-381.
7. A. Brandt, P. Franken, and B. Lisek, Stationary Stochastic Models (Akademie-Verlag, Berlin; Wiley, Chichester, 1990).
8. P. Franken, D. König, U. Arndt, and V. Schmidt, Queues and Point Processes (Akademic-Verlag, Berlin: Wiley, Chichester, 1982).
9. D. Gross and C.M. Harris, Fundamentals of Queueing Theory (Wiley, New York, 1998).
10. L. Kleinrock, R.R. Muntz and E. Rodemich, The processor-sharing queueing model for time-shared systems with bulk arrivals, Networks 1 (1971) 1-13.
11. W. Krämer and M. Langenbach-Belz, Approximate formulae for the delay in the queueing system GI/G/1, in: Proc. ITC 8, Melbourne, Australia, (1976) pp. 235.
12. R. Nunez-Queija, Sojourn times in a processor sharing queue with service interruptions, Queueing Systems 34 (2000) 351-386.
13. V. Ramaswami, The sojourn time in the GI/M/1 queue with processor sharing, J. Appl. Probab. 21 (1984) 437-442.
14. B. Sengupta, An approximation forthe sojourn-time distribution for the GI/G/1 processor-sharing queue, Commun. Statist. Stochastic Models 8 (1992) 35-57.
15. H.C. Tijms, Stochastic Models: An Algorithmic Approach (Wiley, Chichester, 1994).
16. M. van Uitert and S.C. Borst, A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows, Queueing Systems 41 (2002) 123-163.
17. R.W. Wolff, Stochastic Modeling and the Theory of Queues (Prentice-Hall International, Englewood Cliffs, N.J., 1989).
18. S.F. Yashkov, Mathematical problems in the theory of shared-processor systems, J. Soviet Math. 58 (1992) 101-147.
19. (Original Russian version in: Itogi Nauki i Tekhniki, Seriya Teoriya Veroyatnostei, Matematicheskaya Statistika, Teoreticheskaya Kibernetika 29 (1990) 3-82.)
20. A.P. Zwart and O.J. Boxma, Sojourn time asymptotics in the M/G/1 processor sharing queue, Queueing Systems 35 (2000) 141-166.