Skip to main content

Queueing Systems with Unreliable Servers in a Random Environment

  • Conference paper
  • First Online:
Topics in Statistical Simulation

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 114))

  • 1523 Accesses

Abstract

A single-server queueing system with a Poisson input and an unreliable server is studied. The breakdowns of the server are connected to a certain external factor, defined by a regenerative stochastic process. In this paper one assumes that the arrival process, customers’s service times, and an external environment are mutually independent. The service was interrupted by the breakdown of the server is continued after its reconstruction from the point at which it was interrupted. The Laplace–Stiltjese transform of the stationary distribution of virtual waiting time as well as ergodicity condition is given. The limit theorem in heavy traffic situation is established. Two examples of the applications are considered.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Afanasyeva, L.G., Bashtova, E.E.: Coupling method for asymptotic analysis of queues with regenerative input and unreliable server. Queueing Syst. 76(2), 125–147 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  2. Afanasyeva, L.G., Rudenko, I.V.: \(GI\vert G\vert \infty \) queueing systems and their applications to the analysis of traffic models. Theory Prob. Appl. 57(3), 1–26 (2013)

    Google Scholar 

  3. Borovkov, A.A.: Stochastic Processes in Queuing Theory. Springer, New York (1976)

    Book  Google Scholar 

  4. Cox, D.R.: Renewal Theory. Methuen and Co, London; Wiley, New York (1962)

    Google Scholar 

  5. Gaver, D.: A waiting line with interrupted service, including priorities. J. Roy. Stat. Soc. 13(24), (1962)

    Google Scholar 

  6. Gideon, R., Pyke, R.: Markov renewal modelling of Poisson traffic at intersections having separate turn lanes. Semi-Markov Models Appl. 285–310 (1999)

    Google Scholar 

  7. Krishnamoorthy, A., Pramod, P.K., Chakravarthy, S.R.: Queues with interruptions: a survey (2012). Doi:10.1007/s 11750-012-02566

    Google Scholar 

  8. Saaty, T.L.: Elements of Queueing Theory with Applications. Mc Graw Hill, New York (1961)

    MATH  Google Scholar 

  9. Stadjie, W.: The busy period of the queueing system \(M\vert G\vert \infty \). J. Appl. Probab. 3(22), 697–704 (1985)

    Article  Google Scholar 

  10. Thorisson, H.: Coupling, Stationary and Regeneration. Springer, New York (2000)

    MATH  Google Scholar 

Download references

Acknowledgements

The research was partially supported by RFBR grant 13-01-00653.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Elena Bashtova .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this paper

Cite this paper

Afanasyeva, L., Bashtova, E. (2014). Queueing Systems with Unreliable Servers in a Random Environment. In: Melas, V., Mignani, S., Monari, P., Salmaso, L. (eds) Topics in Statistical Simulation. Springer Proceedings in Mathematics & Statistics, vol 114. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2104-1_1

Download citation

Publish with us

Policies and ethics