Skip to main content
SpringerLink
Log in

Unreliable Single-Server Queueing System with Customers of Random Capacity

  • Conference paper
  • First Online:
Computer Networks (CN 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1231))

Included in the following conference series:

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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  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. Bocharov, P.P., D’Apice, C., Pechinkin, A.V., Salerno, S.: Queueing Theory. VSP, Utrecht-Boston (2004)

    MATH  Google Scholar 

  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. Klimov, G.P.: Stochastic Service System. Nauka, Moscow (1966). (In Russian)

    Google Scholar 

  5. König, D., Stoyan, D.: Methoden der Bedienungstheorie. Akademie-Verlag, Berlin (1976)

    MATH  Google Scholar 

  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/BFb0005191

    Article  MathSciNet  Google Scholar 

  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-4

    Book  MATH  Google Scholar 

  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. Tikhonenko, O.M.: Distribution of total message flow in single-server queueing system with group arrival. Autom. Remote Control 46(11), 1412–1416 (1985)

    MATH  Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  11. Tikhonenko, O.M.: Distribution of total flow of calls in group arrival queueing systems. Autom. Remote Control 48(11), 1500–1507 (1987)

    MATH  Google Scholar 

  12. Tikhonenko, O.: Queueing Models in Computer Systems. Universitetskoe, Minsk (1990). (In Russian)

    MATH  Google Scholar 

  13. Tikhonenko, O.M.: Computer Systems Probability Analysis. Akademicka Oficyna Wydawnicza EXIT, Warsaw (2006). (In Polish)

    Google Scholar 

  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/124270

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Cardinal Stefan Wyszyński University in Warsaw, ul. Wóycickiego 1/3, 01-938, Warsaw, Poland

    Oleg Tikhonenko

  2. Institute of Information Technology, Warsaw University of Life Sciences – SGGW, ul. Nowoursynowska 159, 02–787, Warsaw, Poland

    Marcin Ziółkowski

Authors
  1. Oleg Tikhonenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Ziółkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcin Ziółkowski .

Editor information

Editors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Piotr Gaj

  2. Gdańsk University of Technology, Gdańsk, Poland

    Wojciech Gumiński

  3. Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tikhonenko, O., Ziółkowski, M. (2020). Unreliable Single-Server Queueing System with Customers of Random Capacity. In: Gaj, P., Gumiński, W., Kwiecień, A. (eds) Computer Networks. CN 2020. Communications in Computer and Information Science, vol 1231. Springer, Cham. https://doi.org/10.1007/978-3-030-50719-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-50719-0_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-50718-3

  • Online ISBN: 978-3-030-50719-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation