Skip to main content

Methods of Limiting Decomposition and Markovian Summation in Queueing System with Infinite Number of Servers

  • Conference paper
  • First Online:
Information Technologies and Mathematical Modelling. Queueing Theory and Applications (ITMM 2018, WRQ 2018)

Abstract

In this paper, we study the process generated by the customers which are serviced in a queueing system with an infinite number of servers. Two methods referred to as the method of limiting decomposition and the method of Markovian summation are proposed, implemented and compared. The characteristic function of the probability distribution for the studied process is obtained. The numerical examples are performed for different values of queueing system characteristics.

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

Access this chapter

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

    MATH  Google Scholar 

  2. Narayan Bath, U.: An Introduction to Queueing Theory: Modeling and Analysis in Applications. Birkauser, Boston (2008)

    Google Scholar 

  3. Asmussen, S.: Applied Probability and Queues. Stochastic Modelling and Applied Probability. Springer, New-York (2003). https://doi.org/10.1007/b97236

    Book  MATH  Google Scholar 

  4. Shortle, J.F., Thompson, J.M., Gross, D., Harris, C.M.: Fundamentals of Queueing Theory. Wiley, Hoboken, USA (2018)

    Book  Google Scholar 

  5. Kleinrock, L.: Queueing Systems, vol. 1. Wiley Interscience, New York (1975)

    MATH  Google Scholar 

  6. Balsamo, S., De Nitti Persone, V., Inverardi, P.: A review on queueing network models with finite capacity queues for software architectures performance prediction. Perform. Eval. 51(2), 269–288 (2003)

    Article  Google Scholar 

  7. Borst, S., Mandelbaum, A., Reiman, M.I.: Dimensioning large call centers. Oper. Res. 52, 17–34 (2004)

    Article  MathSciNet  Google Scholar 

  8. Brian, H.F., Adan, I.J.B.F.: An infinite-server queue influenced by a semi-Markovian environment. Queueing Syst. 61, 65–84 (2009)

    Article  MathSciNet  Google Scholar 

  9. Dammer, D.: Research of mathematical model of insurance company in the form of queueing system with unlimited number of servers considering “Implicit Advertising”. In: Dudin, A., Nazarov, A., Yakupov, R. (eds.) ITMM 2016. Communications in Computer and Information Science, vol. 564. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25861-4_14

    Chapter  Google Scholar 

  10. Dammer, D.: Research of mathematical model of insurance company in the form of queueing system in a random environment. In: Dudin, A., Nazarov, A., Kirpichnikov, A. (eds.) ITMM 2016. Communications in Computer and Information, vol. 800. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68069-9_17

    Chapter  Google Scholar 

  11. Jidkova, L.A., Moiseeva, S.P.: Mathematical model of customers flow of a two-product trading company in the form of queueing system with repeated access to blocks. News Tomsk Polytech. Univ. 322, 5–9 (2013). (in Russian)

    Google Scholar 

  12. Dammer, D.D., Nazarov, A.A.: Research of the mathematical model of the insurance company in form of the infinite queuing system by using method of asymptotic analysis. In: Proceedings of 7th Ferghan conference “Limit theorems and its applications”, Namangan, pp. 191–196 (2015). (in Russian)

    Google Scholar 

  13. Lee, W.C.Y.: Mobile Cellular Telecommunications: Analog and Digital System, 2nd edn. McGraw-Hill, New York (1995)

    Google Scholar 

  14. Nazarov, A.A., Moiseev, A.N.: Queueing Systems and Networks with Unlimited Number of Servers. NTL, Tomsk (2015). (in Russian)

    Google Scholar 

  15. Cox, D.R., Lewis, P.A.W.: The statistical analysis of series of events. Methuen and Co. Ltd., London (1966)

    Book  Google Scholar 

  16. Dammer, D.D.: A mathematical model of insurance company in the form of a queueing system with an unlimited number of servers considering one-time insurance payments. In: Dudin, A., Nazarov, A. (eds.) ITMM 2016. Communications in Computer and Information Science, vol. 638, pp. 34–43. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44615-8_3

    Chapter  Google Scholar 

  17. Nazarov, A.A., Terpugov, A.F.: Queueing Theory. NTL, Tomsk (2010). (in Russian)

    Google Scholar 

  18. Elsgolts, L.E.: Differential Equations and Calculus of Variations. Science, Moscow (1969). (in Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Diana Dammer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nazarov, A., Dammer, D. (2018). Methods of Limiting Decomposition and Markovian Summation in Queueing System with Infinite Number of Servers. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM WRQ 2018 2018. Communications in Computer and Information Science, vol 912. Springer, Cham. https://doi.org/10.1007/978-3-319-97595-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-97595-5_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-97594-8

  • Online ISBN: 978-3-319-97595-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics