摘要：樣例實(shí)現(xiàn)一實(shí)現(xiàn)二總個(gè)數(shù)總權(quán)重權(quán)重是否都一樣累計(jì)總權(quán)重計(jì)算所有權(quán)重是否一樣如果權(quán)重不相同且權(quán)重大于則按總權(quán)重?cái)?shù)隨機(jī)并確定隨機(jī)值落在哪個(gè)片斷上如果權(quán)重相同或權(quán)重為則均等隨機(jī)想獲取最新內(nèi)容，請(qǐng)關(guān)注微信公眾號(hào)
樣例
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());
實(shí)現(xiàn)一
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
實(shí)現(xiàn)二
public String randomWeight(){
int length = serverMap.size(); // 總個(gè)數(shù)
int totalWeight = 0; // 總權(quán)重
boolean sameWeight = true; // 權(quán)重是否都一樣
for (int i = 0; i < length; i++) {
int weight = serverMap.get(servers.get(i));
totalWeight += weight; // 累計(jì)總權(quán)重
if (sameWeight && i > 0
&& weight != serverMap.get(servers.get(i-1))) {
sameWeight = false; // 計(jì)算所有權(quán)重是否一樣
}
}
if (totalWeight > 0 && ! sameWeight) {
// 如果權(quán)重不相同且權(quán)重大于0則按總權(quán)重?cái)?shù)隨機(jī)
int offset = ThreadLocalRandom.current().nextInt(totalWeight);
// 并確定隨機(jī)值落在哪個(gè)片斷上
for (int i = 0; i < length; i++) {
offset -= serverMap.get(servers.get(i));
if (offset < 0) {
return servers.get(i);
}
}
}
// 如果權(quán)重相同或權(quán)重為0則均等隨機(jī)
return servers.get(ThreadLocalRandom.current().nextInt(length));
}
doc
dubbo-RandomLoadBalance
想獲取最新內(nèi)容，請(qǐng)關(guān)注微信公眾號(hào)
文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請(qǐng)注明本文地址：http://systransis.cn/yun/67135.html
