Fluid Limit for Closed Queueing Network with Several Multi-servers

  • Svetlana AnulovaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10684)


A closed network consists of several multi-servers with n customers. Service requirements of customers at a multi-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 queues the numbers of customers in them, all multiplied by \(n^{-1}\).

Our objective: asymptotics of dynamics as \(n\rightarrow \infty \). The asymptotics of dynamics of a single multi-server and its queue 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 establish the asymptotics for a network in discrete time, find its equilibrium and prove convergence as \(t\rightarrow \infty \).

Motivation for studying such models: they represent call/contact centers and help to construct them effectively.


Call/contact centers Queueing network Multi-server queues Measure-valued processes Fluid limit approximation Fluid limit equilibrium and convergence 


  1. 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, Cham (2016). CrossRefGoogle Scholar
  2. 2.
    Anulova, S.: Properties of fluid limit for closed queueing network with two multi-servers. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2016. CCIS, vol. 678, pp. 369–380. Springer, Cham (2016). CrossRefGoogle Scholar
  3. 3.
    Anulova, S.: Fluid limit for switching closed queueing network with two multi-servers. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2017. CCIS, vol. 700, pp. 343–354. Springer, Cham (2017). CrossRefGoogle Scholar
  4. 4.
    Anulova, S.V.: Age-distribution description and “fluid” approximation for a network with an infinite server. In: Lenand, M. (ed.) International Conference “Probability Theory and its Applications”, Moscow, 26–30 June 2012, pp. 219–220 (2012)Google Scholar
  5. 5.
    Brown, L., Gans, N., Mandelbaum, A., Sakov, A., Shen, H., Zeltyn, S., Zhao, L.: Statistical analysis of a telephone call center: a queueing-science perspective. J. Am. Stat. Assoc. 100(469), 36–50 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Dai, J., He, S.: Many-server queues with customer abandonment: a survey of diffusion and fluid approximations. J. Syst. Sci. Syst. Eng. 21(1), 1–36 (2012). CrossRefGoogle Scholar
  7. 7.
    Davis, M.: Markov Models and Optimization. Monographs on Statistics and Applied Probability, vol. 49. Chapman & Hall, London (1993)CrossRefzbMATHGoogle Scholar
  8. 8.
    Gamarnik, D., Goldberg, D.A.: On the rate of convergence to stationarity of the M/M/\(n\) queue in the Halfin-Whitt regime. Ann. Appl. Probab. 23(5), 1879–1912 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Gamarnik, D., Stolyar, A.L.: Multiclass multiserver queueing system in the Halfin-Whitt heavy traffic regime: asymptotics of the stationary distribution. Queueing Syst. 71(1–2), 25–51 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Kang, W., Pang, G.: Equivalence of fluid models for \(G_t/GI/N+GI\) queues. ArXiv e-prints, February 2015.
  11. 11.
    Kang, W.: Fluid limits of many-server retrial queues with nonpersistent customers. Queueing Syst. 79, 183–219 (2014). MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Kaspi, H., Ramanan, K.: Law of large numbers limits for many-server queues. Ann. Appl. Probab. 21(1), 33–114 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Koçağa, Y.L., Ward, A.R.: Admission control for a multi-server queue with abandonment. Queueing Syst. 65(3), 275–323 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Pang, G., Talreja, R., Whitt, W.: Martingale proofs of many-server heavy-traffic limits for Markovian queues. Probab. Surv. 4, 193–267 (2007).
  15. 15.
    Reed, J.: The \(G/GI/N\) queue in the Halfin-Whitt regime. Ann. Appl. Probab. 19(6), 2211–2269 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Zuñiga, A.W.: Fluid limits of many-server queues with abandonments, general service and continuous patience time distributions. Stoch. Process. Appl. 124(3), 1436–1468 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Ward, A.R.: Asymptotic analysis of queueing systems with reneging: a survey of results for FIFO, single class models. Surv. Oper. Res. Manag. Sci. 17(1), 1–14 (2012). MathSciNetGoogle Scholar
  18. 18.
    Whitt, W.: Engineering solution of a basic call-center model. Manag. Sci. 51(2), 221–235 (2005)CrossRefzbMATHGoogle Scholar
  19. 19.
    Whitt, W.: Fluid models for multiserver queues with abandonments. Oper. Res. 54(1), 37–54 (2006). MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Xiong, W., Altiok, T.: An approximation for multi-server queues with deterministic reneging times. Ann. Oper. Res. 172, 143–151 (2009). MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Yin, G., Zhu, C.: Hybrid Switching Diffusions: Properties and Applications. Springer, Heidelberg (2010). CrossRefzbMATHGoogle Scholar
  22. 22.
    Zhang, J.: Fluid models of many-server queues with abandonment. Queueing Syst. 73(2), 147–193 (2013). MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.IPU RANMoscowRussian Federation

Personalised recommendations