Analysis of Unreliable Single Server Queueing System with Hot Back-Up Server

  • Alexander DudinEmail author
  • Valentina Klimenok
  • Vladimir Vishnevsky
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 499)


In this paper, we analyze an unreliable queueing system consisting of an infinite buffer and two heterogeneous servers. The main server (server 1) is unreliable, while the server 2 is considered as the reserve server and is assumed to be absolutely reliable. The service times have the PH-type (Phase-type) distribution. If both servers are able to provide the service, they serve a customer independently of each other. The service of a customer is completed when his/her service by any of two servers is finished. After the service completion, both servers immediately start the service of the next customer, if he/she presents in the system. If the system is idle, the servers wait for arrival of the new customer. The input flow is described by the BMAP (Batch Markovian Arrival Process). Breakdowns arrive to the server 1 according to a MAP (Markovian Arrival Process). After breakdown occurrence, repair of the server starts. The repair time also has the PH-type (Phase-type) distribution. The customers, which meet the servers busy upon arrival, join a buffer. They will be picked up for the service according to the First-In-First-Out discipline. The customers arrived at the same batch are picked up for the service in random order. If a customer arriving from outside or from a buffer sees only server 2 ready for service while the server 1 is under repair, only server 2 starts the service of this customer. But if server 1 is repaired before service completion of this customer, server 1 immediately begins the service of this customer. For this model, we derive ergodicity condition, calculate the key performance measures of the system and derive an expression for the Laplace-Stieltjes transform of the sojourn time distribution of an arbitrary customer.


Unreliable queueing system Batch Markovian Arrival Process Phase-type distribution Stationary state distribution Sojourn time distribution 



The research is supported by the Russian Foundation for Basic Research (grant No. 14-07-90015) and the Belarusian Republican Foundation for Fundamental Research (grant No. F14R-126).


  1. 1.
    Avrachenkov, K., Dudin, A., Klimenok, V., Nain, P., Semenova, O.: Optimal threshold control by the robots of web search engines with obsolescence of documents. Comput. Netw. 55, 1880–1893 (2011)CrossRefGoogle Scholar
  2. 2.
    Vishnevsky, V., Kozyrev, D., Semenova, O.V.: Redundant queueing system with unreliable servers. In: Proceedings of the 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp. 383–386. Moscow (2014)Google Scholar
  3. 3.
    Arnon, S., Barry, J., Karagiannidis, G., Schober, R., Uysal, M. (eds.): Advanced Optical Wireless Communication Systems. Cambridge University Press, Cambridge (2012)Google Scholar
  4. 4.
    Sharov, S.Y., Semenova, O.V.: Simulation model of wireless channel based on FSO and RF technologies. Distributed Computer and Communication Networks. Theory and Applications (DCCN-2010), pp. 368–374 (2010)Google Scholar
  5. 5.
    Vishnevsky, V.M., Semenova, O.V., Sharov, S.Y.: Modeling and analysis of a hybrid communication channel based on free-space optical and radio-frequency technologies. Autom. Remote Control 72, 345–352 (2013)Google Scholar
  6. 6.
    Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Commun. Stat.-Stoch. Models 7, 1–46 (1991)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Chakravarthy, S.R.: The batch markovian arrival process: a review and future work. In: Krishnamoorthy, A., et al. (eds.) Advances in Probability Theory and Stochastic Processes, pp. 21–49. Notable Publications, NJ (2001)Google Scholar
  8. 8.
    Neuts, M.: Matrix-geometric Solutions in Stochastic Models - An Algorithmic Approach. Johns Hopkins University Press, USA (1981)zbMATHGoogle Scholar
  9. 9.
    Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood, Cichester (1981)zbMATHGoogle Scholar
  10. 10.
    Klimenok, V.I., Dudin, A.N.: Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Systems 54, 245–259 (2006)zbMATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Dudin, A., Klimenok, V.: Moon Ho Lee: recursive formulas for the moments of queue length in the \(BMAP/G/1\) queue. IEEE Commun. Lett. 13, 351–353 (2009)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Alexander Dudin
    • 1
    Email author
  • Valentina Klimenok
    • 1
  • Vladimir Vishnevsky
    • 2
  1. 1.Department of Applied Mathematics and Computer ScienceBelarusian State UniversityMinskBelarus
  2. 2.Institute of Control Sciences of Russian Academy of Sciences and Closed Corporation “Information and Networking Technologies”MoscowRussia

Personalised recommendations