The M/G/1 processor-sharing queue with disasters

Computers and Mathematics with Applications

Volumn 51, Issue 6-7, 2006, Pages 987-998

  Li, Quan Lin ^a   Lin, Chuang ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Disaster; Negative customer; Processor sharing queue; Sojourn time; Supplementary variable method

Indexed keywords

DISASTERS; LAPLACE TRANSFORMS; MATHEMATICAL MODELS; QUEUEING THEORY;

NEGATIVE CUSTOMER; PROCESSOR-SHARING QUEUE; SOJOURN TIME; SUPPLEMENTARY VARIABLE METHOD;

PROGRAM PROCESSORS;

EID: 33745839681     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2005.10.012     Document Type: Article

References (32)

1. Kleinrock L. Analysis of a time-shared processor. Naval Res. Logist. Quart. 11 (1964) 59-73
2. Kleinrock L. Time-shared systems: A theoretical treatment. J. ACM 14 (1967) 242-261
3. Yashkov S.F. Processor-sharing queues: Some progress in analysis. Queueing Systems 2 (1987) 1-17
4. Yashkov S.F. Mathematical problems in the theory of processor-sharing queueing systems. J. Soviet Math. 5 (1992) 101-147
5. Coffman E.G., Muntz R., and Trotter H. Waiting time distributions for processor-sharing systems. J. ACM 17 (1970) 123-130
6. Morrison J.A. Response-time distribution for a processor-sharing system. SIAM J. Appl. Math. 45 (1985) 152-167
7. Sengupta B., and Jagerman D. A conditional response time of the M/M/1 processor-sharing queue. AT&T Techn. J. 64 (1985) 409-421
8. Yashkov S.F. A derivation of response time distribution for an M/G/1 processor- sharing queue. Problems of Control and Information Theory 12 (1983) 133-148
9. Schassberger R. A new approach to the M/G/1 processor-sharing queue. Adv. Appl. Probab. 16 (1984) 202-213
10. Ott T.J. The sojourn-time distribution in the M/G/1 queue with processor-sharing. J. Appl. Probab. 21 (1984) 360-378
11. Kitayev Y., and Yashkov S.F. Analysis of a single-channel queueing system with discipline of uniform sharing of a device. Engrg. Cybernetics 17 (1979) 42-49
12. Asare B.K., and Foster F.G. Conditional response times in the M/G/1 processor-sharing system. J. Appl. Probab. 20 (1983) 910-915
13. Avi-Itzhak B., and Halfin S. Response times in gated M/G/1 systems: The processor-sharing case. Queueing Systems 4 (1989) 263-279
14. Resing J.A.C., Hooghiemstra G., and Keane M.S. The M/G/1 processor-sharing queue as the almost sure limit of feedback queues. J. Appl. Probab. 27 (1990) 913-918
15. Grishechkin S. On a relationship between processor-sharing queues and Crump-Mode-Jagers branching processes. Adv. Appl. Probab. 24 (1992) 653-698
16. Kitayev Y. The M/G/1 processor-sharing model: Transient behavior. Queueing Systems 14 (1993) 239-273
17. Zwart A.P., and Boxma O.J. Sojourn time asymptotics in the M/G/1 processor-sharing queue. Queueing Systems 35 (2000) 141-166
18. Ramaswami V. The sojourn time in the GI/M/1 queue with processor sharing. J. Appl. Prob. 21 (1984) 437-442
19. Jagerman D.L., and Sengupta B. The GI/M/1 processor sharing queue and its heavy traffic analysis. Stochastic Models 7 (1991) 379-395
20. Grishechkin S. GI/G/1 processor sharing queue in heavy traffic. Adv. Appl. Prob. 26 (1994) 539-555
21. Sengupta B. An approximation for the sojourn-time distribution for the GI/G/1 processor-sharing queue. Stochastic Models 8 (1992) 35-57
22. Núñez-Queija R. Sojourn times in non-homogeneous QBD processes with processor sharing. Stochastic Models 17 (2001) 61-92
23. Masuyama H., and Takine T. Sojourn time distribution in a MAP/M/1 processor-sharing queue. Oper. Res. Lett. 31 (2003) 406-412
24. Li Q.L., Lian Z.T., and Liu L.M. An RG-factorization approach for a BMAP/M/1 generalized processorsharing queue. Stochastic Models 21 (2005) 507-530
25. Gelenbe E. Production-form queueing networks with negative and positive customers. J. Appl. Prob. 2 (1991) 656-663
26. Harrison P.G., and Pitel E. The M/G/1 queue with negative customers. Adv. Appl. Prob. 2 (1996) 540-566
27. Chao X., Miyazawa M., and Pinedo M. Queueing Networks: Customers. Signals, and Product Form Solutions (1999), Wiley, Chichester
28. Artalejo J.R. G-networks: A versatile approach for work removal in queueing networks. European J. Oper. Res. 126 (2000) 233-249
29. Li Q.L., and Zhao Y.Q. A MAP/G/1 queue with negative customers. Queueing Systems 47 (2004) 5-43
30. Jain G., and Sigman K. A Pollaczeck-Khinchine formula for M/G/1 queues with disasters. J. Appl. Prob. 33 (1996) 1191-1200
31. Artalejo J.R., and Góez-Corral A. Computation of the limiting distribution in queueing systems with repeated attempts and disasters. RAIRO Operations Research 33 (1999) 371-382
32. Dudin A.N., and Nishimura S. A BMAP/SM/1 queueing system with Markovian arrival of disasters. J. Appl. Prob. 36 (1999) 868-881