Hostname: page-component-89b8bd64d-7zcd7 Total loading time: 0 Render date: 2026-05-05T10:02:01.866Z Has data issue: false hasContentIssue false
  • English
  • Français

SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE

Published online by Cambridge University Press:  01 June 2006

Regina Egorova ,
Bert Zwart  and
Onno Boxma
Regina Egorova
Affiliation:
CWI, 1090 GB Amsterdam, The Netherlands, Department of Mathematics & Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands, E-mail: r.egorova@tue.nl
Bert Zwart
Affiliation:
CWI, 1090 GB Amsterdam, The Netherlands, Department of Mathematics & Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands, E-mail: a.p.zwart@tue.nl
Onno Boxma
Affiliation:
CWI, 1090 GB Amsterdam, The Netherlands, Department of Mathematics & Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands, E-mail: o.j.boxma@tue.nl
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider the sojourn time V in the M/D/1 processor sharing (PS) queue and show that P(V > x) is of the form Ce−γx as x becomes large. The proof involves a geometric random sum representation of V and a connection with Yule processes, which also enables us to simplify Ott's [21] derivation of the Laplace transform of V. Numerical experiments show that the approximation P(V > x) ≈ Ce−γx is excellent even for moderate values of x.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 20 , Issue 3 , July 2006 , pp. 429 - 446
Copyright
© 2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

Abate, J., Choudhury, G.L., & Whitt, W. (1994). Waiting-time tail probabilities in queues with long tail service-time distributions. Queueing Systems 16: 311–338.Google Scholar
Abate, J. & Whitt, W. (1992). The Fourier-series method for inverting transforms of probability distributions. Queueing Systems 10: 5–88.Google Scholar
Abate, J. & Whitt, W. (1997). Asymptotics for M/G/1 low-priority waiting-time tail probabilities. Queueing Systems 25: 173–233.Google Scholar
Asmussen, S. (2003). Applied probability and queues. New York: Springer-Verlag.
Borst, S.C., Boxma, O.J., Morrison, J.A., & Núñez-Queija, R. (2003). The equivalence between processor sharing and service in random order. Operations Research Letters 31: 254–262.Google Scholar
Borst, S.C., Van Ooteghem, D., & Zwart, B. (2005). Tail asymptotics for discriminatory processor sharing queues with heavy-tailed service requirements. Performance Evaluation 61: 281–298.Google Scholar
Breiman, L. (1965). On some limit theorems similar to the arc-sin law. Theory of Probability and its Applications 10: 323–331.Google Scholar
Cox, D.R. & Smith, W.L. (1961). Queues. London: Methuen.
Den Iseger, P. (2006). Numerical transform inversion using Gaussian quadrature. Probability in the Engineering and Informational Sciences 20: 1–44.Google Scholar
Feller, W. (1971). An introduction to probability theory and its applications, Vol. II. New York: Wiley.
Flatto, L. (1997). The waiting time distribution for the random order service M/M/1 queue. Annals of Applied Probability 7: 382–409.Google Scholar
Guillemin, F., Robert, P., & Zwart, A.P. (2003). Tail asymptotics for processor-sharing queues. Advances in Applied Probability 36: 525–543.Google Scholar
Jelenković, P. & Momčilović, P. (2004). Large deviation analysis of subexponential waiting times in a processor-sharing queue. Mathematics of Operations Research 28: 587–608.Google Scholar
Kalashnikov, V. & Tsitsiashvili, G. (1999). Tail of waiting times and their bounds. Queueing Systems 32: 257–283.Google Scholar
Kella, O., Zwart, A.P., & Boxma, O.J. (2005). Some transient properties of symmetric M/G/1 queues. Journal of Applied Probability 42: 223–234.Google Scholar
Kleinrock, L. (1964). Analysis of a time-shared processor. Naval Research Logistics Quarterly 11: 59–73.Google Scholar
Kleinrock, L. (1976). Queueing systems. New York: Wiley.
Kleinrock, L. (1976). Time-shared systems: A theoretical treatment. Journal of the Association for Computing Machinery 14: 242–261.Google Scholar
Mandjes, M. & Zwart, A.P. (2006). Large deviations for sojourn times in Processor Sharing queues. Queueing Systems (to appear).CrossRef
Núñez-Queija, R. (2000). Processor-sharing models for integrated-services networks. Ph.D. thesis, Eindhoven University of Technology, Eindhoven.
Ott, T.J. (1984). The sojourn-time distribution in the M/G/1 queue with processor sharing. Journal of Applied Probability 21: 360–378.Google Scholar
Ramanan, K. & Stolyar, A.L. (2001). Largest weighted delay first scheduling: Large deviations and optimality. Annals of Applied Probability 11: 1–48.Google Scholar
Rege, K.M. & Sengupta, B. (1994). A decomposition theorem and related results for the discriminatory processor sharing queue. Queueing Systems 18: 333–351.Google Scholar
Roberts, J.W. (2000). Engineering for quality of service. In K. Park & W. Willinger (eds.), Self-similar network traffic and performance evaluation. New York: Wiley, pp. 401–420.CrossRef
Ross, S.M. (1996). Stochastic processes. New York: Wiley.
Tijms, H.C. (2003). A first course in stochastic models. Chichester: Wiley.CrossRef
Yashkov, S.F. (1983). A derivation of response time distribution for a M/G/1 processor-sharing queue. Problems of Control and Information Theory 12: 133–148.Google Scholar
Yashkov, S.F. (1993). On heavy traffic limit theorem for the M/G/1 processor sharing queue. Stochastic Models 9: 467–471.Google Scholar
Zwart, A.P. & Boxma, O.J. (2000). Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Systems 35: 141–166.Google Scholar