负载均衡,通过配置的权重选择

最新推荐文章于 2024-06-25 22:11:41 发布

Super_龙

最新推荐文章于 2024-06-25 22:11:41 发布

阅读量130

点赞数

分类专栏： java 文章标签：负载均衡 java 运维

本文链接：https://blog.csdn.net/weixin_50998273/article/details/126217860

版权

java 专栏收录该内容

11 篇文章 1 订阅

订阅专栏

负载均衡,通过配置的权重选择“通道”或者其他等信息

直接看下面一段代码

/**
     * 选择外呼通道
     *
     * @param list 外呼通道集合
     * @return 外呼通道
     */
    public CallWeight select(List<CallWeight> list) {
        // Number of sends
        int length = list.size();
        // Every invoker has the same weight?
        boolean sameWeight = true;
        // the weight of every invokers
        int[] weights = new int[length];
        // the first invoker's weight
        int firstWeight = list.get(0).getWeight();
        weights[0] = firstWeight;
        // The sum of weights
        int totalWeight = firstWeight;
        for (int i = 1; i < length; i++) {
            int weight = list.get(i).getWeight();
            // save for later use
            weights[i] = weight;
            // Sum
            totalWeight += weight;
            if (sameWeight && weight != firstWeight) {
                sameWeight = false;
            }
        }
        if (totalWeight > 0 && !sameWeight) {
            // If (not every invoker has the same weight & at least one invoker's weight>0), select randomly based on totalWeight.
            int offset = ThreadLocalRandom.current().nextInt(totalWeight);
            // Return a invoker based on the random value.
            for (int i = 0; i < length; i++) {
                offset -= weights[i];
                if (offset < 0) {
                    return list.get(i);
                }
            }
        }
        // If all invokers have the same weight value or totalWeight=0, return evenly.
        return list.get(ThreadLocalRandom.current().nextInt(length));
    }