Skip to main content
Log in

Transient analysis of a single server queue with catastrophes, failures and repairs

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

A transient solution is obtained analytically using continued fractions for the system size in an M/M/1 queueing system with catastrophes, server failures and non-zero repair time. The steady state probability of the system size is present. Some key performance measures, namely, throughput, loss probability and response time for the system under consideration are investigated. Further, reliability and availability of the system are analysed. Finally, numerical illustrations are used to discuss the system performance measures.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Atencia I, Moreno P. The discrete time Geo/Geo/1 queue with negative customers and disasters. Comput Oper Res 2004;31(9):1537–48.

    Article  Google Scholar 

  2. Avi-Itzhak B, Naor P. Some queueing problems with service station subject to breakdown. Oper Res 1963;11:303–20

    Google Scholar 

  3. Birolini A. Quality and reliability of technical systems: theory-practice-management. Heidelberg: Springer; 1997.

    Google Scholar 

  4. Bruni C, D’Andrea P, Mocci U, Scoglio C. Optimal capacity management of virtual paths in an ATM network. In: IEEE Globecom 94 Proceedings; 1994.

  5. Bonomi F, Mitra D, Seery J. Adaptive algorithms for feedback-based flow control in high speed wide-area ATM networks. IEEE J Sel Areas Commun 1995;13(7):1267–83.

    Article  Google Scholar 

  6. Chao X. A queueing network model with catastrophes and product form solution. OR Lett 1995;18:75–9.

    Google Scholar 

  7. Chao X, Miyazawa M, Pinedo M. Queueing networks: customers, signals and product form solutions. Chichester: Wiley; 1999.

    Google Scholar 

  8. Chen A, Renshaw E. The M/M/1 queue with mass exodus and mass arrivals when empty. J Appl Probab 1997;34:192–207.

    Article  Google Scholar 

  9. Di Crescenzo A, Giorno V, Nobile AG, Ricciardi LM. On the M/M/1 queue with catastrophes and its continuous approximation. Queueing Syst 2003;43:329–47.

    Article  Google Scholar 

  10. Gautam N. Pricing issues in web hosting services. J Revenue Pricing Manag 2005;4(1):7–23.

    Article  Google Scholar 

  11. Gelenbe E, Pujolle G. Introduction to queueing networks. Chichester: Wiley; 1998.

    Google Scholar 

  12. Harrison PG, Patel NM. Performance modeling of communication networks and computer architectures. Reading: Addison–Wesley; 1993.

    Google Scholar 

  13. Haverkort BR, Marie R, Rubino G, Trivedi K. Performability modeling. New York: Wiley; 2001.

    Google Scholar 

  14. Henderson W. Queueing networks with negative customers and negative queue length. J Appl Probab 1993;30:931–42.

    Article  Google Scholar 

  15. Jain G, Sigman K. A Pollaczek-Khinchine formula for M/G/1 queues with disasters. J Appl Probab 1996;33:1191–200.

    Article  Google Scholar 

  16. Krishna Kumar B, Arivudainambi D. Transient solution of an M/M/1 queue with catastrophes. Comput Math Appl 2000;40:1233–40.

    Article  Google Scholar 

  17. Lavenberg SS. Computer performance modelling handbook. New York: Academic; 1983.

    Google Scholar 

  18. Nagarajan R, Kurose J. On defininig, computing and quaranteeing quality-of-service in high-speed networks. In: Proc. of INFOCOM’ 92. vol 2. Florence, Italy; 1992. p. 2016–25.

  19. Neuts MF, Lucantoni DM. A Markovian queue with N servers subjects to breakdowns and repairs. Manag Sci 1979;25(9):849–61.

    Article  Google Scholar 

  20. Takagi H. Queueing analysis: a foundation of performance evaluation, vacation and priority systems. vol 1. Amsterdam: North-Holland; 1991.

    Google Scholar 

  21. Towsley D, Tripathi SK. A single server priority queue with server failures and queue flushing. OR Lett 1991;10:353–62.

    Google Scholar 

  22. Vinod B. Unreliable queueing systems. Comput Oper Res 1985;12:323–40.

    Article  Google Scholar 

  23. Wartenhorst P. N parallel queueing systems with server breakdown and repair. Eur J Oper Res 1995;82:302–22.

    Article  Google Scholar 

  24. Walrand J, Varaiya P. High-performance communication networks. San Francisco: Kaufmann; 2001.

    Google Scholar 

  25. Widder DV. The Laplace transform. Princeton: Princeton University Press; 1946.

    Google Scholar 

  26. Yanagiya M, Takahashi Y, Takahashi H. Trans IEICE 1990;73(7):1181–6.

    Google Scholar 

  27. Yin N, Hluchyj M. On closed-loop rate control for ATM cell relay networks. In: Proc. of IEEE INFOCOM’ 94; 1994. p. 99–108.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to B. Krishna Kumar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krishna Kumar, B., Krishnamoorthy, A., Pavai Madheswari, S. et al. Transient analysis of a single server queue with catastrophes, failures and repairs. Queueing Syst 56, 133–141 (2007). https://doi.org/10.1007/s11134-007-9014-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-007-9014-0

Keywords

Mathematics Subject Classification (2000)

Navigation