摘要：樣例實現一實現二總個數總權重權重是否都一樣累計總權重計算所有權重是否一樣如果權重不相同且權重大于則按總權重數隨機并確定隨機值落在哪個片斷上如果權重相同或權重為則均等隨機想獲取最新內容，請關注微信公眾號
樣例
private Map serverMap = new HashMap(){{
put("192.168.1.100",1);
put("192.168.1.101",1);
put("192.168.1.102",4);
put("192.168.1.103",1);
put("192.168.1.104",1);
put("192.168.1.105",3);
put("192.168.1.106",1);
put("192.168.1.107",2);
put("192.168.1.108",1);
put("192.168.1.109",1);
put("192.168.1.110",1);
}};
private List servers = new ArrayList<>(serverMap.keySet());
實現一
public void weightRandom(){
Set keySet = serverMap.keySet();
List servers = new ArrayList();
for(Iterator it = keySet.iterator();it.hasNext();){
String server = it.next();
int weight = serverMap.get(server);
for(int i=0;i
實現二
public String randomWeight(){
int length = serverMap.size(); // 總個數
int totalWeight = 0; // 總權重
boolean sameWeight = true; // 權重是否都一樣
for (int i = 0; i < length; i++) {
int weight = serverMap.get(servers.get(i));
totalWeight += weight; // 累計總權重
if (sameWeight && i > 0
&& weight != serverMap.get(servers.get(i-1))) {
sameWeight = false; // 計算所有權重是否一樣
}
}
if (totalWeight > 0 && ! sameWeight) {
// 如果權重不相同且權重大于0則按總權重數隨機
int offset = ThreadLocalRandom.current().nextInt(totalWeight);
// 并確定隨機值落在哪個片斷上
for (int i = 0; i < length; i++) {
offset -= serverMap.get(servers.get(i));
if (offset < 0) {
return servers.get(i);
}
}
}
// 如果權重相同或權重為0則均等隨機
return servers.get(ThreadLocalRandom.current().nextInt(length));
}
doc
dubbo-RandomLoadBalance
想獲取最新內容，請關注微信公眾號
文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。
轉載請注明本文地址：http://m.specialneedsforspecialkids.com/yun/67135.html
