Skip to main content

Synergetic Effects for Number of Busy Servers in Multiserver Queuing Systems

  • Conference paper
  • First Online:
Information Technologies and Mathematical Modelling - Queueing Theory and Applications (ITMM 2015)

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

  • 465 Accesses

Abstract

In this paper we concretize a condition when an aggregation of n oneserver queuing systems into multiserver system for \(n\rightarrow \infty \) leads to an disappearance of a queue (in some probabilistic sense) and to a transformation of multiserver system into a system with infinite number of servers. An initial oneserver system is a system with Poisson input flow or with some modifications of this flow like a regular flow without an aftereffect or with Poisson flow in a random environment. Such formulation of a problem is connected with a large number of articles devoted to a modeling of computer networks by queuing systems with infinite number of servers and to a justification of these models application for real networks with finite number of servers.

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. Zhidkova, L.S., Moiseeva, S.P.: Investigation of fold customers parallel service of simplest flow. Bull. Tomsk Univ. Control Comput. Sci. Inf. 17(4), 49–54 (2011) (In Russian)

    Google Scholar 

  2. Nazarov, A.A., Moiseeva, S.P., Morozova, A.S.: Investigation of queuing systems with reconversion and infinite number of servers by method of limiting decomposition. Calculating Technol. 35, 88–92 (2008) (In Russian)

    Google Scholar 

  3. Borovkov, A.A., Mogulskiy, A.A., Sakhanenko, A.I.: Limit theorems for random processes. Totals of Science and Technique. Series of Modern Problems in Mathematics and Physics. Fundamental Directions, 82, 5–194 (1995) (In Russian)

    Google Scholar 

  4. Chencov, N.N.: Weak convergence of random processes without breaks of second kind. Probab. Theor. Appl. 1(1), 154–161 (1956) (In Russian)

    Google Scholar 

  5. Dmitrovskiy, V.A.: Condition of boundedness and estimates of maximum distribution for random fields on arbitrary sets. Lectures Academy Sciences of USSR. 253(2), 271–274 (1980) (In Russian)

    Google Scholar 

  6. Lifshits, M.A.: On distribution of Gaussian process maximum. Probab. Theor. Appl. 31(1), 134–142 (1986) (In Russian)

    Google Scholar 

  7. Borovkov, A.A.: Asymptotic Methods in Queuing Theory. Science, Moscow (1980) (In Russian)

    Google Scholar 

  8. Khinchin, A.Y.: Researchs on Mathematical Queuing Theory. Phyzmatlit, Moscow (1963) (In Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gurami Tsitsiashvili .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Tsitsiashvili, G., Osipova, M. (2015). Synergetic Effects for Number of Busy Servers in Multiserver Queuing Systems. In: Dudin, A., Nazarov, A., Yakupov, R. (eds) Information Technologies and Mathematical Modelling - Queueing Theory and Applications. ITMM 2015. Communications in Computer and Information Science, vol 564. Springer, Cham. https://doi.org/10.1007/978-3-319-25861-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25861-4_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25860-7

  • Online ISBN: 978-3-319-25861-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics