Abstract
This paper addresses the sojourn time asymptotics for a GI/GI/⋅ queue operating under the Processor Sharing (PS) discipline with stochastically varying service rate. Our focus is on the logarithmic estimates of the tail of sojourn-time distribution, under the assumption that the job-size distribution has a light tail. Whereas upper bounds on the decay rate can be derived under fairly general conditions, the establishment of the corresponding lower bounds requires that the service process satisfies a sample-path large-deviation principle. We show that the class of allowed service processes includes the case where the service rate is modulated by a Markov process. Finally, we extend our results to a similar system operation under the Discriminatory Processor Sharing (DPS) discipline. Our analysis relies predominantly on large-deviations techniques.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Antunes, N., Fricker, C., Guillemin, F., Robert, P.: Perturbation analysis of a variable M/M/1 queue: a probabilistic approach. Adv. Appl. Probab. 38, 263–283 (2006)
Asmussen, S.: Applied Probability and Queues. Springer, New York (2003)
Bekker, R., Borst, S.C., Núñez-Queija, R.: Performance of TCP-friendly streaming sessions in the presence of heavy-tailed elastic flows. In: Performance Evaluation Review. Proceedings of MAMA 2004 Workshop (2004)
Borst, S.C., Boxma, O.J., Morrison, J.A., Núñez-Queija, R.: The equivalence between processor sharing and service in random order. Oper. Res. Lett. 31, 254–262 (2003)
Borst, S.C., Núñez-Queija, R., van Uitert, M.J.G.: User-level performance of elastic traffic in a differentiated-services environment. Perform. Eval. 49, 507–519 (2002)
Borst, S.C., Núñez-Queija, R., Zwart, A.P.: Sojourn time asymptotics in processor-sharing queues. Queueing Syst. 53, 31–51 (2006)
Borst, S.C., van Ooteghem, D., Zwart, A.P.: Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements. Perform. Eval. 61, 281–298 (2005)
Chang, C.-S.: Sample path large deviations and intree networks. Queueing Syst. 20, 7–36 (1995)
Dembo, A., Zeitouni, O.: Large Deviation Techniques and Applications. Springer, New York (1998)
Egorova, R., Zwart, B., Boxma, O.: Sojourn time tails in the M/D/1 processor sharing queue. Probab. Eng. Inf. Sci. 20, 429–446 (2006)
Flatto, L.: The waiting time distribution for the random order service M/M/1 queue. Ann. Appl. Probab. 7, 382–409 (1997)
Glynn, P.W., Whitt, W.: Logarithmic asymptotics for steady-state tail probabilities in a single-server queue. J. Appl. Probab. A 31, 131–156 (1994)
Jelenković, P., Momčilović, P.: Large deviation analysis of subexponential waiting times in a processor-sharing queue. Math. Oper. Res. 28, 587–608 (2004)
Kesidis, G., Walrand, J., Chang, C.-S.: Effective bandwidths for multi-class Markov fluids and other ATM sources. IEEE/ACM Trans. Netw. 1, 424–428 (1993)
Mandjes, M., Zwart, A.P.: Large deviations for sojourn times in processor sharing queues. Queueing Syst. 52, 237–250 (2006)
Núñez-Queija, R.: Processor-sharing models for integrated-services networks. PhD thesis, Eindhoven University of Technology (2000)
Nuyens, M., Zwart, A.P.: A large deviations analysis of the GI/GI/1 SRPT queue. Queueing Syst. 54, 85–97 (2006)
Ott, T.J.: The sojourn-time distribution in the M/G/1 queue with processor sharing. J. Appl. Probab. 21, 360–378 (1984)
Palmowski, Z., Rolski, T.: On the exact asymptotics of the busy period in GI/GI/1 queues. Adv. Appl. Probab. 38, 792–803 (2006)
Roberts, J.: Traffic theory and the internet. IEEE Commun. Mag. 39, 94–99 (2001)
Schassberger, R.: A new approach to the M/G/1 processor sharing queue. Adv. Appl. Probab. 16, 802–813 (1984)
Whitt, W.: Tail probabilities with statistical multiplexing and effective bandwidths in multi-class queues. Telecommun. Syst. 2, 71–107 (1993)
Yashkov, S.F.: A derivation of response time distribution for an M/G/1 processor-sharing queue. Probl. Control Inf. Theory 12, 133–148 (1983)
Zwart, A.P., Boxma, O.J.: Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Syst. 35, 141–166 (2000)
Zhang, Z.-L.: Large deviations and the generalized processor sharing scheduling for a two-queue system. Queueing Syst. 26, 229–254 (1997)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Egorova, R., Mandjes, M. & Zwart, B. Sojourn time asymptotics in Processor Sharing queues with varying service rate. Queueing Syst 56, 169–181 (2007). https://doi.org/10.1007/s11134-007-9026-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-007-9026-9