Skip to main content
SpringerLink
Log in

Sojourn times in a processor sharing queue with service interruptions

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We study the sojourn times of customers in an M/M/1 queue with the processor sharing service discipline and a server that is subject to breakdowns. The lengths of the breakdowns have a general distribution, whereas the “on-periods” are exponentially distributed. A branching process approach leads to a decomposition of the sojourn time, in which the components are independent of each other and can be investigated separately. We derive the Laplace–Stieltjes transform of the sojourn-time distribution in steady state, and show that the expected sojourn time is not proportional to the service requirement. In the heavy-traffic limit, the sojourn time conditioned on the service requirement and scaled by the traffic load is shown to be exponentially distributed. The results can be used for the performance analysis of elastic traffic in communication networks, in particular, the ABR service class in ATM networks, and best-effort services in IP networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Abate and W. Whitt, The Fourier-series method for inverting transforms of probability distributions, Queueing Systems 10 (1992) 5–87.

    Google Scholar 

  2. E.G. Coffman, R.R. Muntz and H. Trotter, Waiting time distributions for processor sharing systems, J. Assoc. Comput. Mach. 17 (1970) 123–130.

    Google Scholar 

  3. J.W. Cohen, The multiple phase service network with generalised processor sharing, Acta Informatica 12 (1979) 245–284.

    Google Scholar 

  4. J.W. Cohen, The Single Server Queue, 2nd ed. (North-Holland, Amsterdam, 1982).

  5. A. de Meyer and J.L. Teugels, On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1, J. Appl. Probab. 17 (1980) 802–813.

    Google Scholar 

  6. A. Federgruen and L. Green, Queueing systems with service interruptions, Oper. Res. 34 (1986) 752–768.

    Google Scholar 

  7. A. Federgruen and L. Green, Queueing systems with service interruptions II, Naval Res. Logist. 35 (1988) 345–358.

    Google Scholar 

  8. W. Feller, An Introduction to Probability Theory and its Applications (Wiley, New York, 1966).

    Google Scholar 

  9. R.D. Foley and G.-A. Klutke, Stationary increments in the accumulated work process in processor sharing queues, J. Appl. Probab. 26 (1989) 671–677.

    Google Scholar 

  10. S.W. Fuhrmann and R.B. Cooper, Stochastic decompositions in the M/G/1 queue with generalised vacations, Oper. Res. 33 (1985) 1117–1129.

    Google Scholar 

  11. D.P. Gaver, Jr., A waiting line with interrupted service, including priorities, J. Roy. Statist. Soc. 24 (1962) 73–90.

    Google Scholar 

  12. S.A. Grishechkin, Crump-Mode–Jagers branching processes as a method of investigating M/G/1 systems with processor sharing, Theory Probab. Appl. 36 (1991) 19–35 (translated from Teor. Veroyatnost. i Primenen. 36 (1991) 16–33 (in Russian)).

    Google Scholar 

  13. S.A. Grishechkin, On a relationship between processor sharing queues and Crump-Mode–Jagers branching processes, Adv. in Appl. Probab. 24 (1992) 653–698.

    Google Scholar 

  14. M.Yu. Kitayev and S.F. Yashkov, Analysis of a single-channel queueing system with the discipline of uniform sharing of a device, Engrg. Cybernet. 17 (1979) 42–49.

    Google Scholar 

  15. D.-S. Lee, Analysis of a single server queue with semi-Markovian service interruption, Queueing Systems 27 (1997) 153–178.

    Google Scholar 

  16. W. Li, D. Shi and X. Chao, Reliability analysis of M/G/1 queueing systems with server breakdowns and vacations, J. Appl. Probab. 34 (1997) 546–555.

    Google Scholar 

  17. I. Mitrani and B. Avi-Itzhak, A many server queue with service interruptions, Oper. Res. 16 (1968) 628–638.

    Google Scholar 

  18. J.A. Morrison, Response-time distribution for a processor sharing system, SIAM J. Appl. Math. 45 (1985) 152–167.

    Google Scholar 

  19. M.F. Neuts, Matrix-geometric Solutions in Stochastic Models – An Algorithmic Approach (Johns Hopkins Univ. Press, Baltimore, MD, 1981).

    Google Scholar 

  20. R. NÚñez-Queija, Sojourn times in non-homogeneous QBD processes with processor sharing, CWI Report PNA-R9901 (1999), submitted for publication.

  21. T.J. Ott, The sojourn time distributions in the M/G/1 queue with processor sharing, J. Appl. Probab. 21 (1984) 360–378.

    Google Scholar 

  22. K.M. Rege and B. Sengupta, A decomposition theorem and related results for the discriminatory processor sharing queue, Queueing Systems 18 (1994) 333–351.

    Google Scholar 

  23. J.W. Roberts, Realising quality of service guarantees in multiservice networks, in: Proc. IFIP Seminar PMCCN'97 (1997).

  24. M. Sakata, S. Noguchi and J. Oizumi, Analysis of a processor shared queueing model for time sharing systems, in: Proc. of the 2nd Hawaii Internat. Conf. on System Sciences (1969) pp. 625–628.

  25. R. Schassberger, A new approach to the M/G/1 processor sharing queue, Adv. in Appl. Probab. 16 (1984) 202–213.

    Google Scholar 

  26. B. Sengupta, A queue with service interruptions in an alternating random environment, Oper. Res. 38 (1990) 308–318.

    Google Scholar 

  27. B. Sengupta, An approximation for the sojourn-time distribution for the GI/G/1 processor-sharing queue, Comm. Statist. Stochastic. Models 8 (1992) 35–57.

    Google Scholar 

  28. B. Sengupta and D.L. Jagerman, A conditional response time of the M/M/1 processor sharing queue, AT & T Techn. J. 64 (1985) 409–421.

    Google Scholar 

  29. T. Takine and B. Sengupta, A single server queue with server interruptions, Queueing Systems 26 (1997) 285–300.

    Google Scholar 

  30. H.C. Tijms, Stochastic Models – An Algorithmic Approach (Wiley, Chichester, UK, 1994).

    Google Scholar 

  31. Traffic management specification, Version 4.0, The ATM Forum Technical Committee (April 1996).

  32. J.L. van den Berg and O.J. Boxma, The M/G/1 queue with processor sharing and its relation to a feedback queue, Queueing Systems 9 (1991) 365–401.

    Google Scholar 

  33. P.D. Welch, On a generalised M/G/1 queueing process in which the first customer of each busy period receives exceptional service, Oper. Res. 12 (1964) 736–752.

    Google Scholar 

  34. H. White and L.S. Christie, Queuing with preemptive priorities or with breakdown, Oper. Res. 6 (1958) 79–95.

    Google Scholar 

  35. R.W. Wolff, Poisson arrivals see time averages, Oper. Res. 30 (1982) 223–231.

    Google Scholar 

  36. S.F. Yashkov, A derivation of response time distribution for a M/G/1 processor-sharing queue, Probl. Control. Inform. Theory 12 (1983) 133–148.

    Google Scholar 

  37. S.F. Yashkov, New applications of random time change to the analysis of processor sharing queues, in: Proc. of the 4th Internat. Vilnius Conf. on Probability Theory and Mathematical Statistics (1985) pp. 343–345.

  38. S.F. Yashkov, Processor-sharing queues: Some progress in analysis, Queueing Systems 2 (1987) 1–17.

    Google Scholar 

  39. S.F. Yashkov, Mathematical problems in the theory of processor-sharing queueing systems, J. Soviet Math. 58 (1992) 101–147.

    Google Scholar 

  40. S.F. Yashkov, On a heavy-traffic limit theorem for the M/G/1 processor-sharing queue, Comm. Statist. Stochastic Models 9(3) (1993) 467–471.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, P.O. Box 94079, 1090 GB, Amsterdam, The Netherlands

    R. Núñez-Queija

Authors
  1. R. Núñez-Queija
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Núñez-Queija, R. Sojourn times in a processor sharing queue with service interruptions. Queueing Systems 34, 351–386 (2000). https://doi.org/10.1023/A:1019173523289

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019173523289

Search

Navigation