Skip to main content
SpringerLink
Log in

Ergodic theorem for a queue with unreliable server

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

A single server queue with unreliable server is considered. The server breakdown probability depends on the state of a random medium described by a Markov chain. An ergodic theorem is proved for this system.

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. H. White and L. S. Christie, “Queuing with preemptive priorities or with breakdown,” Operations Res. 6(1), 79–95 (1958).

    Article  MathSciNet  Google Scholar 

  2. D. P. Gaver, Jr., “A waiting line with interrupted service including priority,” J. Roy. Statist. Soc. Ser. B 24, 73–90 (1962).

    MATH  MathSciNet  Google Scholar 

  3. J. Keilson, “Queues subject to service interruptions,” Ann. Math. Statist. 33(4), 1314–1322 (1962).

    Article  MATH  MathSciNet  Google Scholar 

  4. T. Kernane, A Single Server Retrial Queue with Different Types of Server Interruptions, E-print (2009).

    Google Scholar 

  5. A. Krishnamoorthy, P. K. Pramod, and T.G. Deepak, “On a queue with interruptions and repeat or resumption of service,” Nonlinear Anal., Theory Methods Appl., Ser. A, Theory Methods 71(12), e-Suppl., e1673–e1683 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  6. L. G. Afanas’eva, “Queues with cyclic control processes,” Kibernetika i Sistemnyi Analiz 41(1), 54–68 (2005).

    MathSciNet  Google Scholar 

  7. L. G. Afanasyeva and E. E. Bashtova, “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 

  8. R. A. Howard, “Research in semi-Markovian decision structures,” J. Oper. Res. Soc. Japan 6(4), 163–199 (1964).

    Google Scholar 

  9. L. G. Afanasyeva, E. E. Bashtova, and E. V. Bulinskaya, “Limit theorems for semi-Markov queues and their applications,” Comm. Statist. Simulation Comput. 41(6), 688–709 (2012).

    Article  MATH  MathSciNet  Google Scholar 

  10. L. G. Afanas’eva and E. V. Bulinskaya, Stochastic Processes in the Theory of Queues and Inventory Control (Izd.Moskov. Univ., Moscow, 1980) [in Russian].

    MATH  Google Scholar 

  11. A. A. Borovkov, Stochastic Processes in Queueing Theory (Nauka, Moscow, 1972) [in Russian].

    MATH  Google Scholar 

  12. L. G. Afanas’eva and A. V. Tkachenko, “Multichannel queueing systems with regenerative input flow,” Teor. Veroyatnost. i Primenen. [Theory Probab. Appl.] 58(2), 210–234 (2013) [Theory Probab. Appl. 58 (2), 174–192 (2013)].

    Article  MathSciNet  Google Scholar 

  13. T. L. Saaty, Elements of Queueing Theory. With Applications (McGraw-Hill, New York, 1961; Sovetskoe Radio, Moscow, 1971).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lomonosov Moscow State University, Moscow, Russia

    S. Zh. Aibatov

Authors
  1. S. Zh. Aibatov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Zh. Aibatov.

Additional information

Original Russian Text © S. Zh. Aibatov, 2015, published in Matematicheskie Zametki, 2015, Vol. 97, No. 6, pp. 803–814.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Aibatov, S.Z. Ergodic theorem for a queue with unreliable server. Math Notes 97, 821–830 (2015). https://doi.org/10.1134/S0001434615050181

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation