Before revision:  We further analyse a policy where SQ(d_i) resp LL(d_i) is used with probability p_i . For the shortest queue variant, we obtain the limit \frac{1{\log\left(\sum_{i=1}^np_id_i\right)}, while for the least loaded variant, we obtain \frac{1}{\sum_{i=1}^np_id_i-1}.} {\sum_ip_id_i-1}.
After revision:  We further analyse a policy where SQ(d_i) resp LL(d_i) is used with probability p_i . For the shortest queue variant, we obtain the limit \frac{1{\log\left(\sum_{i=1}^np_id_i\right)}, while for the least loaded variant, we obtain \frac{1}{\sum_{i=1}^np_id_i-1}.} , we show that the limit is given by \frac{1{\sum_ip_id_i-1}.