詳解Nginx輪詢算法底層實(shí)現(xiàn)的方法

public class SimplePolling {

  /**
   * key是ip
   */
  public static List <String> ipService = new LinkedList <>();
  static {
    ipService.add("192.168.1.1");
    ipService.add("192.168.1.2");
    ipService.add("192.168.1.3");
  }
  public static int pos = 0;
  public static String getIp(){
    if(pos >= ipService.size()){
      //防止索引越界
      pos = 0;
    }
    String ip = ipService.get(pos);
    pos ++;
    return ip;

  }

  public static void main(String[] args) {
    for (int i = 0; i < 4; i++) {
      System.out.println(getIp());

    }
  }
}

public class WeightPolling {

  /**
   * key是ip,value是權(quán)重
   */
  public static Map<String, Integer> ipService = new LinkedHashMap<>();
  static {
    ipService.put("192.168.1.1", 5);
    ipService.put("192.168.1.2", 1);
    ipService.put("192.168.1.3", 1);
  }
  public static int requestId = 0;
  public static int getAndIncrement() {
    return requestId++;
  }

  public static String getIp(){
    //獲取總的權(quán)重
    int totalWeight =0;
    for (Integer value : ipService.values()) {
      totalWeight+= value;
    }
    //獲取當(dāng)前輪詢的值
    int andIncrement = getAndIncrement();
    int pos = andIncrement% totalWeight;
    for (String ip : ipService.keySet()) {
      if(pos < ipService.get(ip)){
        return ip;
      }
      pos -= ipService.get(ip);
    }
    return null;
  }

  public static void main(String[] args) {
    for (int i = 0; i < 7; i++) {
      System.out.println(getIp());
    }
  }

}

public class Polling {

  /**
   * key是ip,value是權(quán)重
   */
  public static Map <String,Integer> ipService = new LinkedHashMap <>();
  static {
    ipService.put("192.168.1.1",5);
    ipService.put("192.168.1.2",1);
    ipService.put("192.168.1.3",1);
  }
  private static Map<String,Weight> weightMap = new LinkedHashMap <>();

  public static String getIp(){
    //計(jì)算總的權(quán)重
     int totalWeight = 0;
    for (Integer value : ipService.values()) {
      totalWeight+=value;
    }
    //首先判斷weightMap是否為空
    if(weightMap.isEmpty()){
      ipService.forEach((ip,weight)->{
        Weight weights = new Weight(ip, weight,0);
        weightMap.put(ip,weights);
      });
    }
    //給map中得對(duì)象設(shè)置當(dāng)前權(quán)重
    weightMap.forEach((ip,weight)->{
      weight.setCurrentWeight(weight.getWeight() + weight.getCurrentWeight());
    });

    //判斷最大權(quán)重是否大于當(dāng)前權(quán)重,如果為空或者小于當(dāng)前權(quán)重，則把當(dāng)前權(quán)重賦值給最大權(quán)重
    Weight maxWeight = null;
    for (Weight weight : weightMap.values()) {
      if(maxWeight ==null || weight.getCurrentWeight() > maxWeight.getCurrentWeight()){
        maxWeight = weight;
      }
    }
    //最后把當(dāng)前最大權(quán)重減去總的權(quán)重
    maxWeight.setCurrentWeight(maxWeight.getCurrentWeight() - totalWeight);
    //返回
    return maxWeight.getIp();
  }

  public static void main(String[] args) {
    //模擬輪詢7次取ip
    for (int i = 0; i < 7; i++) {
      System.out.println(getIp());
    }
  }

}

class Weight{
  /**
   * ip
   */
  private String ip;
  /**
   * 設(shè)置得權(quán)重
   */
  private int weight;
  /**
   * 當(dāng)前權(quán)重
   */
  private int currentWeight;

  public Weight(String ip, int weight,int currentWeight) {
    this.ip = ip;
    this.weight = weight;
    this.currentWeight = currentWeight;
  }

  public String getIp() {
    return ip;
  }

  public void setIp(String ip) {
    this.ip = ip;
  }

  public int getWeight() {
    return weight;
  }

  public void setWeight(int weight) {
    this.weight = weight;
  }

  public int getCurrentWeight() {
    return currentWeight;
  }

  public void setCurrentWeight(int currentWeight) {
    this.currentWeight = currentWeight;
  }
}