Skip to main content
SpringerLink
Log in

Queueing Systems with Demands of Random Space Requirement and Limited Queueing or Sojourn Time

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

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

Included in the following conference series:

  • 1005 Accesses

Abstract

We investigate queueing systems with demands of random space requirements and limited buffer space, in which queueing or sojourn time are limited by some constant value. For such systems, in the case of exponentially distributed service time and Poisson entry, we obtain the steady-state demands number distribution and probability of demands losing.

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. Gaver, D.P.: Observing stochastic processes, and approximate transform inversion. Oper. Res. 14(3), 444–459 (1966)

    Article  MathSciNet  Google Scholar 

  2. Gnedenko, B.V., Kovalenko, I.N.: Introduction to Queueing Theory. Birkhäuser, Boston (1989)

    Book  MATH  Google Scholar 

  3. Morozov, E., Nekrasova, R., Potakhina, L., Tikhonenko, O.: Asymptotic analysis of queueing systems with finite buffer space. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2014. CCIS, vol. 431, pp. 223–232. Springer, Cham (2014). doi:10.1007/978-3-319-07941-7_23

    Chapter  Google Scholar 

  4. Stehfest, H.: Algorithm 368: numeric inversion of Laplace transform. Commun. ACM 13(1), 47–49 (1970)

    Article  Google Scholar 

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

    Google Scholar 

  6. Tikhonenko, O.: Determination of loss characteristics in queueing systems with demands of random space requirement. In: Dudin, A., Nazarov, A., Yakupov, R. (eds.) ITMM 2015. CCIS, vol. 564, pp. 209–215. Springer, Cham (2015). doi:10.1007/978-3-319-25861-4_18

    Chapter  Google Scholar 

  7. Tikhonenko, O.: Districted capacity queueing systems: Determination of their characteristics. Autom. Remote Control. 58(6), Pt.1, 969–972 (1997)

    Google Scholar 

  8. Tikhonenko, O.M.: Generalized Erlang problem for service systems with finite total capacity. Probl. Inf. Transm. 41(3), 243–253 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Tikhonenko, O.M.: Queueing Models in Information Systems. Universitetskoe, Minsk (1990). (In Russian)

    MATH  Google Scholar 

  10. Tikhonenko, O.M.: Queueing systems of a random length demands with restrictions. Autom. Remote Control. 52(10), pt. 2, 1431–1437 (1991)

    Google Scholar 

  11. Tikhonenko, O.: Queueing systems with common buffer: a theoretical treatment. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2011. CCIS, vol. 160, pp. 61–69. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21771-5_8

    Chapter  Google Scholar 

  12. Tikhonenko, O.M.: Queuing systems with processor sharing and limited resources. Autom. Remote Control. 71(5), 803–815 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Natural Sciences, College of Sciences, Cardinal Stefan Wyszyński University in Warsaw, Ul. Wóycickiego 1/3, 01-938, Warsaw, Poland

    Oleg Tikhonenko

  2. Institute of Mathematics, Czestochowa University of Technology, Al. Armii Krajowej 21, 42-200, Czestochowa, Poland

    Pawel Zajac

Authors
  1. Oleg Tikhonenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pawel Zajac
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oleg Tikhonenko .

Editor information

Editors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Piotr Gaj

  2. Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień

  3. Silesian University of Technology, Gliwice, Poland

    Michał Sawicki

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Tikhonenko, O., Zajac, P. (2017). Queueing Systems with Demands of Random Space Requirement and Limited Queueing or Sojourn Time. In: Gaj, P., Kwiecień, A., Sawicki, M. (eds) Computer Networks. CN 2017. Communications in Computer and Information Science, vol 718. Springer, Cham. https://doi.org/10.1007/978-3-319-59767-6_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59767-6_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59766-9

  • Online ISBN: 978-3-319-59767-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation