Mean-field fluctuations at diffusion scale in threshold-based randomized routing for processor sharing systems and applications

References

• Allmeier, S.; Gast, N. Mean field and refined mean field approximations for heterogeneous systems. Proc. ACM Meas. Anal. Comput. Syst. 2022, 6, 1–43. DOI: 10.1145/3508033.
   Google Scholar
• Billingsley, P. Convergence of Probability Measures; John Wiley & Sons, Inc.: New York, 1999.
   Google Scholar
• Bortolussi, L.; Hayden, R.A. Bounds on the deviation of discrete-time Markov chains from their mean-field model. Perform. Eval. 2013, 70, 736–749. DOI: 10.1016/j.peva.2013.08.012.
   Web of Science ®Google Scholar
• Deimling, K. Ordinary Differential Equations in Banach Spaces; Springer: Heidelberg, 1977.
   Google Scholar
• Ephremides, A.; Varaiya, P.; Walrand, J. A simple dynamic routing problem. IEEE Trans. Automat. Contr. 1980, 25, 690–693. DOI: 10.1109/TAC.1980.1102445.
   Web of Science ®Google Scholar
• Ethier, S.N.; Kurtz, T.G. Markov Processes: Characterization and Convergence; John Wiley & Sons, Inc.: New York, 1986.
   Google Scholar
• Foss, S.; Chernova, N. On the stability of a partially accessible multi-station queue with state-dependent routing. Queueing Syst. 1998, 29, 55–73. DOI: 10.1023/A:1019175812444.
   Web of Science ®Google Scholar
• Gast, N. Expected values estimated via mean-field approximation are 1/N-accurate. Proc. ACM Meas. Anal. Comput. Syst. 2017, 1, 1–26. DOI: 10.1145/3084454.
   Google Scholar
• Gast, N.; Bortolussi, L.; Tribastone, M. Size expansions of mean field approximation: Transient and steady-state analysis. Perform. Eval. 2019, 129, 60–80. DOI: 10.1016/j.peva.2018.09.005.
   Web of Science ®Google Scholar
• Gast, N.; Van Houdt, B. A refined mean field approximation. Proc. ACM Meas. Anal. Comput. Syst. 2017, 1, 1–28. DOI: 10.1145/3154491.
   Google Scholar
• Graham, C. Functional central limit theorems for a large network in which customers ioin the shortest of several queues. Probab. Theory Relat. Fields 2005, 131, 97–120. DOI: 10.1007/s00440-004-0372-9.
   Web of Science ®Google Scholar
• Hairi, X.; Liu, L.; Ying. Beyond scaling: Calculable error bounds of the power-of-two-choices mean-field model in heavy-traffic. Proceedings of the Twenty-Second International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc ’21), New York, NY, USA, 2021.
   Google Scholar
• Horváth, I.A.; Scully, Z.; Van Houdt, B. Mean field analysis of ioin-below-threshold load balancing for resource sharing servers. Proc. ACM Meas. Anal. Comput. Syst. 2019, 3, 1–21. DOI: 10.1145/3366705.
   Google Scholar
• Khalil, H.K. Nonlinear Systems; Prentice-Hall: New Jersey, 2002.
   Google Scholar
• Lu, Y.; Xie, Q.; Kliot, G.; Geller, A.; Larus, J.R.; Greenberg, A. Join-idle-queue: A novel load balancing algorithm for dynamically scalable web services. Perform. Eval. 2011, 68, 1056–1071. DOI: 10.1016/j.peva.2011.07.015.
   Web of Science ®Google Scholar
• Martin, J.B.; Suhov, Y.M. Fast Jackson networks. Ann. Appl. Probab. 1999, 9, 854–870. DOI: 10.1214/aoap/1029962816.
   Web of Science ®Google Scholar
• Mitzenmacher, M. The Power of Two Choices in Randomized Load Balancing, PhD thesis, University of California, Berkeley, 1991.
   Google Scholar
• Mukhopadhyay, A.; Karthik, A.; Mazumdar, R.R. Randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay. Stoch. Syst. 2016, 6, 90–131. DOI: 10.1287/15-SSY179.
   Google Scholar
• Mukhopadhyay, A.; Mazumdar, R.R. Analysis of randomized join-the-shortest-queue (JSQ) schemes in large heterogeneous processor-sharing systems. IEEE Trans. Control Netw. Syst. 2016, 3, 116–126. DOI: 10.1109/TCNS.2015.2428331.
   Web of Science ®Google Scholar
• Randone, F.; Bortolussi, L.; Tribastone, M. Refining mean-field approximations by dynamic state truncation. Proc. ACM Meas. Anal. Comput. Syst. 2021, 5, 1–30. DOI: 10.1145/3460092.
   Google Scholar
• Schassberger, R. A new approach to the M/G/1 processor-sharing queue. Adv. Appl. Probab. 1984, 16, 202–213. DOI: 10.1017/S0001867800022412.
   Web of Science ®Google Scholar
• Seneta, E. Non-Negative Matrices and Markov Chains; Springer: New York, 2006.
   Google Scholar
• Vasantam, T.; Mazumdar, R.R. On occupancy based randomized routing schemes in large systems of shared servers. In 30th International Teletraffic Congress (ITC 30), ITC Press, Vienna, Austria, 2018.
   Google Scholar
• Vasantam, T.; Mazumdar, R. R. Fluctuations around the mean-field for a large scale Erlang loss system under the SQ(d) load balancing. In 31st International Teletraffic Congress, ITC 31, Budapest, Hungary, 2019.
   Google Scholar
• Vasantam, T.; Mazumdar, R.R. Sensitivity of mean-field fluctuations in Erlang loss models with randomized routing. J. Appl. Probab. 2021, 58, 428–448. DOI: 10.1017/jpr.2020.99.
   Web of Science ®Google Scholar
• Vasantam, T.; Mukhopadhyay, A.; Mazumdar, R.R. The mean-field behavior of processor sharing systems with general job lengths under the SQ (d) policy. Perform. Eval. 2018, 127-128, 120–153. DOI: 10.1016/j.peva.2018.09.010.
   Web of Science ®Google Scholar
• Vvedenskaya, N.D.; Dobrushin, R.L.; Karpelevich, F.I. Queueing system with selection of the shortest of two queues: An asymptotic approach. Probl. Inf. Transm. 1996, 32, 15–27.
   Google Scholar
• Weng, W.; Zhou, X.; Srikant, R. Optimal load balancing with locality constraints. Proc. ACM Meas. Anal. Comput. Syst. 2020, 4, 1–37. DOI: 10.1145/3428330.
   Google Scholar
• Winston, W. Optimality of the shortest line discipline. J. Appl. Probab. 1977, 14, 181–189. DOI: 10.1017/S0021900200104772.
   Web of Science ®Google Scholar
• Ying, L. On the approximation error of mean-field models. Sigmetr. Perform. Eval. Rev. 2016, 44, 285–297. DOI: 10.1145/2964791.2901463.
   Google Scholar
• Ying, L. Stein’s method for mean field approximations in light and heavy traffic regimes. Proc. ACM Meas. Anal. Comput. Syst. 2017, 1, 1–27. DOI: 10.1145/3084449.
   Google Scholar
• Zhou, X.; Wu, F.; Tan, J.; Sun, Y.; Shroff, N. Designing low-complexity heavy-traffic delay-optimal load balancing schemes. Proc. ACM Meas. Anal. Comput. Syst. 2017, 1, 1–30. DOI: 10.1145/3154498.
   Google Scholar