Enhancing the power of two choices load balancing algorithm using round robin policy

This paper proposes a new version of the power of two choices, SQ(d), load balancing algorithm. This new algorithm improves the performance of the classical model based on the power of two choices randomized load balancing. This model considers jobs that arrive at a dispatcher as a Poisson stream of rate $\lambda n, \lambda < 1, at a set of n servers. Using the power of two choices, the dispatcher chooses some d constant for each job...