Skip to main content
SpringerLink
Log in

On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes

  • Non-Classical Models of the Queuing Theory
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We derive the Laplace-Stiltjes transforms of busy period and sojourn time distributions in the M/G/1 queue with egalitarian processor sharing (EPS) and the possibility of (external) catastrophes. Each arrival of the catastrophes immediately removes all the positive jobs (and hence unfinished work) in this non work-conserving queueing system. One of the main results is obtained by means of the so-called method of decomposition into delay elements introduced by the first author.

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. Li, Q.-L., Constructive Computation in Stochastic Models with Applications, Berlin: Springer, 2009.

    Google Scholar 

  2. Zhen, Q. and Knessl, C., Asymptotic Expansions for the Conditional Sojourn Time Distribution in the M/M/1-PS Queue, Queueing Syst., 2007. vol. 57, pp. 157–168.

    Article  MATH  MathSciNet  Google Scholar 

  3. Brandt, A. and Brandt, M., Waiting Times for M/M Systems under State-Dependent Processor Sharing, Queueing Syst., 2008, vol. 59, pp. 297–319.

    Article  MATH  MathSciNet  Google Scholar 

  4. Brandt, A. and Brandt, M., Insensitivity Bounds for the Moments of the Sojourn Times in M/GI Systems under State-Dependent Processor Sharing, Report 09-02, Zuse Inst. Berlin (ZIB), 2009, pp. 1–25.

  5. Kleinrock, L., Analysis of a Time-Shared Processor, Naval Res. Logistics Quart., 1964, vol. 11, pp. 59–73.

    Article  MATH  MathSciNet  Google Scholar 

  6. Kleinrock, L., Queueing Systems, vol. 2: Computer Applications, New York: Wiley, 1976. Translated under the title Vychislitel’nye sistemy s ocheredyami, Moscow: Mir, 1979.

    Google Scholar 

  7. Yashkov, S.F., The Non-Stationary Distribution of Numbers of Calls in the M/G/1 Processor-Sharing Queue, Advances in Simulation, P.A. Lukar and B. Schmidt, Eds., Berlin: Springer, 1988, vol. 2, pp. 158–162.

    Google Scholar 

  8. Yashkov, S.F., Analiz ocheredei v EVM (Analysis of Queues in Computers), Moscow: Radio i Svyaz’, 1989.

    Google Scholar 

  9. Yashkov, S.F., Mathematical Problems in the Theory of Shared-Processor Systems, J. Soviet Math., 1992, vol. 58, no. 2, pp. 101–147.

    Article  Google Scholar 

  10. Kitayev, M.Yu. and Yashkov, S.F., Distribution of the Conditional Sojourn Time in a System with Division of Time of Servicing, Eng. Cybernetics, 1978, vol. 16, no. 4, pp. 162–167.

    Google Scholar 

  11. Yashkov, S.F., A Derivation of Response Time Distribution for an M/G/1 Processor-Sharing Queue, Problems Control Inform. Theory, 1983, vol., 12, no. 2, pp. 133–148.

    MATH  MathSciNet  Google Scholar 

  12. Yashkov, S.F. and Yashkova, A.S., Some Insight into the Time-Dependent Properties of the Queue-Length Process in the M/G/1-EPS and LCFS-P Queues, Inform. Proc., 2005, vol. 5, no. 2, pp. 102–105 (available at http://www.jip.ru/).

    Google Scholar 

  13. Yashkov, S.F. and Yashkova, A.S., Processor Sharing: A Survey of the Mathematical Theory, Autom. Remote Control, 2007, vol. 68, no. 9, pp. 1662–1731.

    Article  MATH  Google Scholar 

  14. Sevast’yanov, B.A., An Ergodic Theorem for Markov Processes and Its Application to Telephone Systems with Refusals, Theor. Prob. Appl., 1957, vol. 2, no. 1, pp. 104–112.

    Article  Google Scholar 

  15. Jaiswal, N.K., Priority Queues, New York: Academic, 1968. Translated under the title Ocheredi s prioritetami, Moscow: Mir, 1973.

    MATH  Google Scholar 

  16. Yashkov, S.F., Processor-Sharing Queues: Some Progress in Analysis (Invited Paper), Queueing Syst., 1987, vol. 2, no. 1, pp. 1–17.

    Article  MATH  MathSciNet  Google Scholar 

  17. Gelenbe, E., Glynn, P., and Sigman, K., Queues with Negative Arrivals, Appl. Probab., 1991, vol. 28, no. 1, pp. 245–250.

    Article  MATH  MathSciNet  Google Scholar 

  18. Bocharov, P.P. and Vishnevskii, V.M., G-Networks: Development of the Theory of Multiplicative Networks, Autom. Remote Control, 2003, vol. 64, no. 5, pp. 714–739.

    Article  MATH  MathSciNet  Google Scholar 

  19. Jain, G. and Sigman, K., A Pollaczek-Khinchine Formula for M/G/1 Queues with Disasters, J. Appl. Probab., 1996, vol. 33, pp. 1191–1200.

    Article  MATH  MathSciNet  Google Scholar 

  20. Li, Q.-L. and Lin, C., The M/G/1 Processor-Sharing Queue with Disasters, Comput. Math. Appl., 2006, vol. 51, no. 6–7, pp. 987–998.

    Article  MathSciNet  Google Scholar 

  21. Yashkov, S.F., A Note on Application of the Method of Supplementary Variables to the Analysis of a Processor Sharing System, Autom. Remote Control, 2008, vol. 69, no. 9, pp. 1662–1669.

    Article  Google Scholar 

  22. Bhat, U.N., An Introduction to Queueing Theory. Modeling and Analysis in Applications., New York: Springer, 2008.

    Google Scholar 

  23. Takács, L., Introduction to the Theory of Queues, Oxford: Oxford Univ. Press, 1962.

    Google Scholar 

  24. Yashkov, S.F., Properties of Invariance of Probabilistic Models of Adaptive Scheduling in Shared-Use Systems, Autom. Control Comput. Sci., 1980, vol. 14, no. 6, pp. 46–51.

    MATH  MathSciNet  Google Scholar 

  25. Kelly, F.P., Reversibility and Stochastic Networks, New York: Wiley, 1979.

    MATH  Google Scholar 

  26. Abramowitz, M. and Stegun, L.A., Handbook of Mathematical Functions, New York: Dover, 1972.

    MATH  Google Scholar 

  27. Yashkov, S.F., The M/D/1-EPS Queue Revisited, Proc. Dobrushin Int. Conf., Moscow: Inst. Inform. Transm. Problems, 2009, pp. 179–185 (available as full paper on CD-ROM).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information Transmission Problems (Kharkevich Institute), Russian Academy of Sciences, Moscow, Russia

    S. F. Yashkov

  2. Municipal Institute, Zhukovskii, Moscow oblast, Russia

    A. S. Yashkova

Authors
  1. S. F. Yashkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Yashkova
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © S.F. Yashkov, A.S. Yashkova, 2009, published in Avtomatika i Telemekhanika, 2009, No. 12, pp. 134–146.

This work was supported in part by the DITCS Program for Fundamental Research in 2006, project no. 4.6. The article was translated by the authors.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yashkov, S.F., Yashkova, A.S. On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes. Autom Remote Control 70, 2061–2072 (2009). https://doi.org/10.1134/S0005117909120133

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117909120133

Keywords

Search

Navigation