Advertisement

Unreliable Single-Server Queueing System with Customers of Random Capacity

  • Oleg Tikhonenko
  • Marcin ZiółkowskiEmail author
Conference paper
  • 65 Downloads
Part of the Communications in Computer and Information Science book series (CCIS, volume 1231)

Abstract

In the paper, we investigate one-server queueing system with stationary Poisson arrival process, non-homogeneous customers and unreliable server. As non-homogenity, we mean that each customer is characterized by some arbitrarily distributed random capacity that is called customer volume. Service time of a customer generally depends on his volume. The server can be broken when it is free or busy and the renewal period goes on for random time having an arbitrary distribution. During this period, customers present in the system and arriving to it are not served. Their service continues immediately after renewal period termination. For such systems, we determine the distribution of total volume of customers present in it. An analysis of some special cases and some numerical examples are attached as well.

Keywords

Queueing system with non-homogeneous customers Unreliable queueing system Total volume Additional event method Laplace-Stieltjes transform 

References

  1. 1.
    Aleksandrov, A.M., Katz, B.A.: Non-homogeneous demands arrival servicing. Izv. AN SSSR. Tekhnicheskaya Kibernetika. 2, 47–53 (1973). (in Russian)Google Scholar
  2. 2.
    Bocharov, P.P., D’Apice, C., Pechinkin, A.V., Salerno, S.: Queueing Theory. VSP, Utrecht-Boston (2004)zbMATHGoogle Scholar
  3. 3.
    Gnedenko, B.V., Danielyan, E.A., Dimitrov, B.N., Klimov, G.P., Matveev, V.F.: Priority Queues. Moscow University Edition, Moscow (1973). (In Russian)Google Scholar
  4. 4.
    Klimov, G.P.: Stochastic Service System. Nauka, Moscow (1966). (In Russian)Google Scholar
  5. 5.
    König, D., Stoyan, D.: Methoden der Bedienungstheorie. Akademie-Verlag, Berlin (1976)zbMATHGoogle Scholar
  6. 6.
    Sengupta, B.: The spatial requirements of M/G/1 queue or: how to design for buffer space. Lect. Notes Contr. Inf. Sci. 60, 547–562 (1984).  https://doi.org/10.1007/BFb0005191MathSciNetCrossRefGoogle Scholar
  7. 7.
    Tian, N., Zhang, Z.G.: Vacation Queueing Models Theory and Applications. ISORMS, vol. 93. Springer, Boston (2006).  https://doi.org/10.1007/978-0-387-33723-4CrossRefzbMATHGoogle Scholar
  8. 8.
    Tikhonenko, O.M.: Determination of the characteristics of the total amount of customers in queues with absolute priority. Automation and Remote Control. vol. 60, part 2, no. 8, p. 1205–1210 (1999)Google Scholar
  9. 9.
    Tikhonenko, O.M.: Distribution of total message flow in single-server queueing system with group arrival. Autom. Remote Control 46(11), 1412–1416 (1985)zbMATHGoogle Scholar
  10. 10.
    Tikhonenko, O.M.: The problem of determination of the summarized messages volume in queueing system and its applications. J. Inf. Process. Cybern. 32(7), 339–352 (1987)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Tikhonenko, O.M.: Distribution of total flow of calls in group arrival queueing systems. Autom. Remote Control 48(11), 1500–1507 (1987)zbMATHGoogle Scholar
  12. 12.
    Tikhonenko, O.: Queueing Models in Computer Systems. Universitetskoe, Minsk (1990). (In Russian)zbMATHGoogle Scholar
  13. 13.
    Tikhonenko, O.M.: Computer Systems Probability Analysis. Akademicka Oficyna Wydawnicza EXIT, Warsaw (2006). (In Polish)Google Scholar
  14. 14.
    Tikhonenko, O., Ziółkowski, M.: Single-server queueing system with external and internal customers. Bull. Polish Acad. Sci. Tech. Sci. 66(4), 539–551 (2018).  https://doi.org/10.24425/124270CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Institute of Computer ScienceCardinal Stefan Wyszyński University in WarsawWarsawPoland
  2. 2.Institute of Information TechnologyWarsaw University of Life Sciences – SGGWWarsawPoland

Personalised recommendations