Tail asymptotics for processor-sharing queues. (English) Zbl 1054.60094
This paper deals with the M/G/1 queue with processor sharing. The main goal of the paper is to obtain sufficient conditions for the validity of the reduced-service rate approximation which establishes a tail equivalence between the distributions of the sojourn time and the service time of a customer. The present study extends the state of the art to a wide class of processor-sharing queues including state-dependent processor sharing. The study is extended to cover queues with finite buffer and queues with impatience.
Reviewer: Jesus R. Artalejo (Madrid)
MSC:
| 60K25 | Queueing theory (aspects of probability theory) |
| 90B22 | Queues and service in operations research |
References:
| [1] | Asmussen, S. (1987). Applied Probability and Queues . John Wiley, Chichester. · Zbl 0624.60098 |
| [2] | Asmussen, S., Klüppelberg, C. and Sigman, K. (1999). Sampling at subexponential times, with queueing applications. Stoch. Process. Appl. 79 , 265–286. · Zbl 0961.60080 · doi:10.1016/S0304-4149(98)00064-7 |
| [3] | Bonald, T. and Proutière, A. (2002). Insensitivity in processor-sharing networks. Performance Evaluation 49 , 193–209. · Zbl 1043.68004 · doi:10.1016/S0166-5316(02)00110-4 |
| [4] | Boyer, J., Guillemin, F., Robert, P. and Zwart, B. (2003). Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks. In Proc. IEEE Infocomm 2003 (San Francisco, CA, March–April 2003), pp. 186–195. |
| [5] | Burman, D. Y. (1981). Insensitivity in queueing systems. Adv. Appl. Prob. 13 , 846–859. · Zbl 0475.60080 · doi:10.2307/1426976 |
| [6] | Clark, D., Shenker, S. and Zhang, L. (1992). Supporting real time applications in an integrated services packet network: architecture and mechanism. In Proc. Sigcomm’92 (Baltimore, MD, August 1992), ACM, New York, pp. 14–26. |
| [7] | Cline, D. B. H. (1994). Intermediate regular and \(\Pi\) variation. Proc. London Math. Soc. 68 , 594–616. · Zbl 0793.26004 · doi:10.1112/plms/s3-68.3.594 |
| [8] | Coffman, E., Puhalskii, A. A., Reiman, M. I. and Wright, P. E. (1994). Processor shared queues with reneging. Performance Evaluation 19 , 25–46. · Zbl 0818.68029 · doi:10.1016/0166-5316(94)90053-1 |
| [9] | Cohen, J. W. (1979). The multiple phase service network with generalized processor sharing. Acta Informatica 12 , 245–284. · Zbl 0396.68038 · doi:10.1007/BF00264581 |
| [10] | Daley, D. J. (2001). The busy period of the M/GI/\(\infty\) queue. Queueing Systems 38 , 195–204. · Zbl 0973.90020 · doi:10.1023/A:1010958415137 |
| [11] | Foss, S. and Korshunov, D. (2000). Sampling at a random time with a heavy-tailed distribution. Markov Process. Relat. Fields 6 , 543–568. · Zbl 0977.60091 |
| [12] | Jelenković, P. and Momčilović, P. (2003). Large deviation analysis of subexponential waiting time in a processor sharing queue. Math. Operat. Res. 28 , 587–608. · Zbl 1082.60083 · doi:10.1287/moor.28.3.587.16396 |
| [13] | Jelenković, P., Momčilović, P. and Zwart, A. P. (2001). Reduced-load equivalence and subexponentiality. Submitted. · Zbl 1056.90032 |
| [14] | Kelly, F. P. (1976). Networks of queues. Adv. Appl. Prob. 8 , 416–432. · Zbl 0337.60076 · doi:10.2307/1425912 |
| [15] | Kleinrock, L. (1976). Queueing Systems . John Wiley, New York. · Zbl 0361.60082 |
| [16] | Núñez-Queija, R. (2000). Processor sharing models for integrated services networks. Doctoral Thesis, Eindhoven University of Technology. · Zbl 0953.68016 |
| [17] | Resnick, S. and Samorodnitsky, G. (1999). Activity periods of an infinite server queue and performance of certain heavy tailed fluid queues. Queueing Systems 33 , 43–71. · Zbl 0997.60111 · doi:10.1023/A:1019163826499 |
| [18] | Van den Berg, J. L. and Boxma, O. J. (1991). The M/G/1 queue with processor sharing and its relation to a feedback queue. Queueing Systems 9 , 365–401. · Zbl 0743.60090 · doi:10.1007/BF01159223 |
| [19] | Zwart, A. P. (2001). Tail asymptotics for the busy period in the GI/G/1 queue. Math. Operat. Res. 26 , 485–493. · Zbl 1073.90510 · doi:10.1287/moor.26.3.485.10584 |
| [20] | Zwart, A. P. and Boxma, O. J. (2000). Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Systems 35 , 141–166. · Zbl 0997.90024 · doi:10.1023/A:1019142010994 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
