Sojourn time distribution in a MAP/M/1 processor-sharing queue

Operations Research Letters

Volumn 31, Issue 5, 2003, Pages 406-412

  Masuyama, Hiroyuki ^a   Takine, Tetsuya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Exponential services; Markovian arrival process (MAP); Processor sharing (PS); Sojourn time distribution

Indexed keywords

COMPUTATIONAL METHODS; LAPLACE TRANSFORMS; MARKOV PROCESSES; QUEUEING THEORY; SERVERS;

PROCESSOR-SHARING;

PROGRAM PROCESSORS;

EID: 0037811212     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00028-2     Document Type: Article

References (18)

1. Asmussen S. Applied Probability and Queues. 1987;Wiley, Chichester.
2. Asmussen S., Koole G. Marked point processes as limits of Markovian arrival streams. J. Appl. Probab. 30:1993;365-372.
3. S.C. Borst, O.J. Boxma, J.A. Morrison, R. Núñez Queija, The equivalence between processor sharing and service in random order, Oper. Res. Lett., 2003, to appear.
4. Coffman E.G. Jr., Muntz R.R., Trotter H. Waiting time distributions for processor-sharing systems. J. ACM. 17:1970;123-130.
5. Cohen J.W. On processor sharing and random service. J. Appl. Probab. 21:1984;937.
6. Fox B.L., Glynn P.W. Computing Poisson probabilities. Comm. ACM. 31:1988;440-445.
7. Grishechkin S. GI/G/1 processor sharing queue in heavy traffic. Adv. Appl. Probab. 26:1994;539-555.
8. Guillemin F., Boyer J. Analysis of the M/M/1 queue with processor sharing via spectral theory. Queueing Systems. 39:2001;377-397.
9. Jagerman D.L., Sengupta B. The GI/M/1 processor-sharing queue and its heavy traffic analysis. Stochastic Models. 7:1991;379-395.
10. Lucantoni D.M., Meier-Hellstern K.S., Neuts M.F. A single-server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Probab. 22:1990;676-705.
11. Morrison J.A. Response-time distribution for a processor-sharing system. SIAM J. Appl. Math. 45:1985;152-167.
12. Neuts M.F. Structured Stochastic Matrices of M/G/1 Type and Their Applications. 1989;Marcel Dekker, New York.
13. Ott T.J. The sojourn-time distribution in the M/G/1 queue with processor sharing. J. Appl. Probab. 21:1984;360-378.
14. Ramaswami V. The sojourn time in the GI/M/1 queue with processor sharing. J. Appl. Probab. 21:1984;437-442.
15. Sengupta B. An approximation for the sojourn-time distribution for the GI/G/1 processor-sharing queue. Stochastic Models. 8:1992;35-57.
16. Sengupta B., Jagerman D.L. A conditional response time of the M/M/1 processor-sharing queue. AT&T Tech. J. 64:1985;409-421.
17. Tijms H.C. Stochastic Models: An Algorithmic Approach. 1994;Wiley, Chichester.
18. Yashkov S.F. A derivation of response time distribution for an M/G/1 processor-sharing queue. Problems of Control Inform. Theory. 12:1983;133-148.