Skip to main content

Properties of Fluid Limit for Closed Queueing Network with Two Multi-servers

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks (DCCN 2016)

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

Abstract

A closed network consists of two multi-servers with n customers. Service requirements of customers at a server have a common cdf. State parameters of the network: for each multi-server empirical measure of the age of customers being serviced and for the queue the number of customers in it, all multiplied by \(n^{-1}\).

Our objective: asymptotics of dynamics as \(n\rightarrow \infty \). The asymptotics of dynamics of a single multi-server with an arrival process as the number of servers \(n\rightarrow \infty \) is currently studied by famous scientists K. Ramanan, W. Whitt et al. Presently there are no universal results for general distributions of service requirements—the results are either for continuous or for discrete time ones; the same for the arrival process. We develop our previous asymptotics results for a network in discrete time: find equilibrium and prove convergence as \(t\rightarrow \infty \).

Motivation for studying such models: they represent call/contact centers.

S. Anulova—This work was supported by RFBR grant No. 14-01-00319 “Asymptotic analysis of queueing systems and nets”.

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

Notes

  1. 1.

    for the last equality see “Expected value” in Wikipedia.

References

  1. Anulova, S.: Approximate description of dynamics of a closed queueing network including multi-servers. In: Vishnevsky, V., Kozyrev, D. (eds.) DCCN 2015. CCIS, vol. 601, pp. 177–187. Springer, Heidelberg (2016). doi:10.1007/978-3-319-30843-2_19

    Chapter  Google Scholar 

  2. Whitt, W.: Fluid models for multiserver queues with abandonments. Oper. Res. 54(1), 37–54 (2006). http://pubsonline.informs.org/doi/abs/10.1287/opre.1050.0227

    Article  MathSciNet  MATH  Google Scholar 

  3. Walsh Zuñiga, A.: Fluid limits of many-server queues with abandonments, general service and continuous patience time distributions. Stochastic Processes Appl. 124(3), 1436–1468 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  4. Davis, M.: Markov Models and Optimization. Monographs on Statistics and Applied Probability, vol. 49. Chapman & Hall, London (1993)

    Book  MATH  Google Scholar 

  5. Yin, G., Zhu, C.: Hybrid Switching Diffusions. Properties and Applications. Springer, New York (2010)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Svetlana Anulova .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Anulova, S. (2016). Properties of Fluid Limit for Closed Queueing Network with Two Multi-servers. In: Vishnevskiy, V., Samouylov, K., Kozyrev, D. (eds) Distributed Computer and Communication Networks. DCCN 2016. Communications in Computer and Information Science, vol 678. Springer, Cham. https://doi.org/10.1007/978-3-319-51917-3_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51917-3_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51916-6

  • Online ISBN: 978-3-319-51917-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics