Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay

References

• Altman, E., Ayesta, U., and Prabhu, B. J. (2008). Load balancing in processor sharing systems. Telecommunication Systems 47, 1–2, 35–48.Google Scholar
• Anantharam, V. and Benchekroun, M. (1993). A technique for computing sojourn times large networks of interacting queues. Probability in Engineering and Informational Sciences 7, 441–464.Google Scholar
• Bramson, M. (2011). Stability of join the shortest queue networks. Annals of Applied Probability 21, 4, 1568–1625. MR2857457Google Scholar
• Bramson, M., Lu, Y., and Prabhakar, B. (2010). Randomized load balancing with general service time distributions. In Proceedings of the ACM SIGMETRICS. 275–286.Google Scholar
• Bramson, M., Lu, Y., and Prabhakar, B. (2012). Asymptotic independence of queues under randomized load balancing. Queueing Systems 71, 3, 247–292. MR2943660Google Scholar
• Budhiraja, A. and Lee, C. (2008). Stationary distribution convergence for generalized Jackson networks in heavy traffic. Mathematics of Operations Research 34, 1, 45–56. MR2542988Link, Google Scholar
• Ethier, S. N. and Kurtz, T. G. (1985). Markov Processes: Characterization and Convergence. John Wiley and Sons Ltd. MR0838085Google Scholar
• Gamarnik, D. and Zeevi, A. (2006). Validity of heavy traffic steady-state approximations in generalized Jackson networks. The Annals of Applied Probability 16, 1, 56–90. MR2209336Google Scholar
• Graham, C. (2000). Chaoticity on path space for a queueing network with selection of shortest queue among several. Journal of Applied Probability 37, 1, 198–211. MR1761670Google Scholar
• Gupta, V., Balter, M. H., Sigman, K., and Whitt, W. (2007). Analysis of join-the-shortest-queue routing for web server farms. Performance Evaluation 64, 9–12, 1062–1081.Google Scholar
• Haddad, J.-P. and Mazumdar, R. R. (2012). Heavy traffic approximation for the stationary distribution of stochastic fluid networks. Queueing Syst. 70, 1, 3–21. MR2886474Google Scholar
• Kelly, F. P. (1979). Reversibility and Stochastic Networks. John Wiley and Sons Ltd. MR0554920Google Scholar
• Martin, J. B. and Suhov, Y. M. (1999). Fast Jackson networks. Annals of Applied Probability 9, 3, 854–870. MR1722285Google Scholar
• Mitzenmacher, M. (1996). The power of two choices in randomized load balancing. Ph.D. thesis, Harvard University. MR2695522Google Scholar
• Mitzenmacher, M. (2001). The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems 12, 10, 1094–1104.Google Scholar
• Mukhopadhyay, A., Karthik, A., Mazumdar, R. R., and Guillemin, F. (2015). Mean field and propagation of chaos in multi-class heterogeneous loss models. Performance Evaluation 91, 117–131.Google Scholar
• Mukhopadhyay, A. and Mazumdar, R. R. (2014). Rate-based randomized routing in large heterogeneous processor sharing systems. In Proceedings of the 26th International Teletraffic Congress (ITC 26). 1–9.Google Scholar
• Mukhopadhyay, A. and Mazumdar, R. R. (2015). Analysis of randomized join-the-shortest-queue (JSQ) schemes in large heterogeneous processor sharing systems. IEEE Transactions on Control of Network Systems 3, 2, 116–126. MR3514587Google Scholar
• Psounis, K. and Prabhakar, B. (2002). Efficient randomized web-cache replacement schemes using samples from past eviction times. IEEE/ACM Transactions on Networking 10, 4, 441–454.Google Scholar
• Schassberger, R. (1984). A new approach to the M/G/1 processor-sharing queue. Advances in Applied Probability 16, 1, 202–213. MR0732137Google Scholar
• Schurman, E. and Brutlag, J. (2009). The user and business impact on server delays, additional bytes and http chunking in web search. In O’Reilly Velocity Web Performance and Operations Conference.Google Scholar
• Sznitman, A. S. (1991). Topics in propagation of chaos. In École d’été de probabilites de Saint-Flour XIX -1989. Lecture Notes in Mathematics, Vol. 1464. Springer, 165–251. MR1108185Google Scholar
• Turner, S. R. E. (1998). The effect of increasing routing choice on resource pooling. Probability in the Engineering and Informational Sciences 12, 109–124. MR1492143Google Scholar
• Vvedenskaya, N. D., Dobrushin, R. L., and Karpelevich, F. I. (1996). Queueing system with selection of the shortest of two queues: an asymptotic approach. Problems of Information Transmission 32, 1, 20–34. MR1384927Google Scholar
• Weber, R. R. (1978). On the optimal assignment of customers to parallel servers. Journal of Applied Probability 15, 406–413. MR0518586Google Scholar
• Winston, W. (1977). Optimality of the shortest line discipline. Journal of Applied Probability 14, 1, 181–189. MR0428516Google Scholar
• Xie, Q., Dong, X., Lu, Y., and Srikant, R. (2015). Power of d choices for large-scale bin packing: A loss model. In Proceedings of ACM SIGMETRICS.Google Scholar
• Xu, J. and Hajek, B. (2013). The supermarket game. Stochastic Systems 3, 2, 405–441. MR3353208Link, Google Scholar
• Zachary, S. (2007). A note on insensitivity in stochastic networks. Journal of Applied Probability 44, 1, 238–248. MR2312999Google Scholar