Abstract
We consider the M/M/1 queue with processor sharing. We study the conditional sojourn time distribution, conditioned on the customer’s service requirement, in various asymptotic limits. These include large time and/or large service request, and heavy traffic, where the arrival rate is only slightly less than the service rate. The asymptotic formulas relate to, and extend, some results of Morrison (SIAM J. Appl. Math. 45:152–167, [1985]) and Flatto (Ann. Appl. Probab. 7:382–409, [1997]).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kleinrock, L.: Analysis of a time-shared processor. Nav. Res. Logist. Q. 11, 59–73 (1964)
Kleinrock, L.: Time-shared systems: a theoretical treatment. J. ACM 14, 242–261 (1967)
Coffman, E.G. Jr., Muntz, R.R., Trotter, H.: Waiting time distributions for processor-sharing systems. J. ACM 17, 123–130 (1970)
Morrison, J.A.: Response-time distribution for a processor-sharing system. SIAM J. Appl. Math. 45, 152–167 (1985)
Vaulot, E.: Délais d’attente des appels téléphoniques traités au hasard. C.R. Acad. Sci. Paris 222, 268–269 (1946)
Riordan, J.: Delay curves for calls served at random. Bell Syst. Tech. J. 32, 100–119 (1953)
Kingman, J.F.C.: On queues in which customers are served in random order. Proc. Camb. Philos. Soc. 58, 79–91 (1962)
Flatto, L.: The waiting time distribution for the random order service M/M/1 queue. Ann. Appl. Probab. 7, 382–409 (1997)
Riordan, J.: Stochastic Service Systems. Wiley, New York (1962)
Pollaczek, F.: La loi d’attente des appels téléphoniques. C.R. Acad. Sci. Paris 222, 353–355 (1946)
Cohen, J.W.: On processor sharing and random service (Letter to the editor). J. Appl. Probab. 21, 937–937 (1984)
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)
Ramaswami, V.: The sojourn time in the GI/M/1 queue with processor sharing. J. Appl. Probab. 21, 445–450 (1984)
Yashkov, S.F.: Processor-sharing queues: some progress in analysis. Queueing Syst. 2, 1–17 (1987)
Yashkov, S.F.: Mathematical problems in the theory of processor-sharing queueing systems. J. Sov. Math. 58, 101–147 (1992)
Ott, T.J.: The sojourn time distribution in the M/G/1 queue with processor sharing. J. Appl. Probab. 21, 360–378 (1984)
Egorova, R., Zwart, A.P., Boxma, O.J.: Sojourn time tails in the M/D/1 processor sharing queue. Probab. Eng. Inf. Sci. 20, 429–446 (2006)
Mandjes, M.R.H., Zwart, A.P.: Large deviations of sojourn times in processor sharing queues. Queueing Syst. 52, 237–250 (2006)
Zwart, A.P., Boxma, O.J.: Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Syst. 35, 141–166 (2000)
Borst, S., Núñez-Queija, R., Zwart, B.: Sojourn time asymptotics in processor-sharing queues. Queueing Syst. 53, 31–51 (2006)
Wong, R.: Asymptotic Approximation of Integrals. SIAM, Philadelphia (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partly supported by NSF grant DMS 05-03745.
Rights and permissions
About this article
Cite this article
Zhen, Q., Knessl, C. Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue. Queueing Syst 57, 157–168 (2007). https://doi.org/10.1007/s11134-007-9054-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-007-9054-5