一起写RPC框架（二十一）RPC服务消费者三--服务消费者负载策略

最新推荐文章于 2024-08-31 15:45:13 发布

BazingaLyncc

最新推荐文章于 2024-08-31 15:45:13 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏：一起写RPC

本文链接：https://blog.youkuaiyun.com/linuu/article/details/52787542

一起写RPC 专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一种简单的负载均衡算法实现，包括随机、加权随机及轮询三种策略，并提供了具体的Java代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

所谓负载策略，其实相对比较简单，某个消费者去远程调用某个服务，不过提供这个服务不止一个实例，那么建立的长连接就不止一个，所以需要做的事情就是根据某个策略在这个长连接中选择一个进行通讯

本Demo RPC只实现了三个比较常用的负载策略

1）随机

2）加权随机

3）轮询

下面给出实现：

package org.laopopo.client.loadbalance;

import java.util.Random;
import java.util.concurrent.CopyOnWriteArrayList;
import java.util.concurrent.ThreadLocalRandom;
import java.util.concurrent.atomic.AtomicInteger;

import org.laopopo.common.utils.ChannelGroup;

/**
 * 
 * @author BazingaLyn
 * @description 负载均衡算法
 * @time 2016年9月1日17:48:47
 * @modifytime 2016年9月8日
 */
public enum LoadBalanceStrategies {
	
	//随机
	RANDOMSTRATEGIES(new LoadBalance(){

		@Override
		public ChannelGroup select(CopyOnWriteArrayList<ChannelGroup> arrayList) {
			Random random = new Random();
			int randomPos = random.nextInt(arrayList.size());
			
			return arrayList.get(randomPos);
		}
		
	}),
	
	//加权随机
	WEIGHTRANDOMSTRATEGIES(new LoadBalance(){

		@Override
		public ChannelGroup select(CopyOnWriteArrayList<ChannelGroup> arrayList) {
			int count = arrayList.size();
			if (count == 0) {
				throw new IllegalArgumentException("empty elements for select");
			}
			if (count == 1) {
				return arrayList.get(0);
			}
			int totalWeight = 0;
			int[] weightSnapshots = new int[count];
			for (int i = 0; i < count; i++) {
				totalWeight += (weightSnapshots[i] = getWeight(arrayList.get(i)));
			}

			boolean allSameWeight = true;
			for (int i = 1; i < count; i++) {
				if (weightSnapshots[0] != weightSnapshots[i]) {
					allSameWeight = false;
					break;
				}
			}

			ThreadLocalRandom random = ThreadLocalRandom.current();
			// 如果权重不相同且总权重大于0, 则按总权重数随机
			if (!allSameWeight && totalWeight > 0) {
				int offset = random.nextInt(totalWeight);
				// 确定随机值落在哪个片
				for (int i = 0; i < count; i++) {
					offset -= weightSnapshots[i];
					if (offset < 0) {
						return arrayList.get(i);
					}
				}
			}

			return (ChannelGroup) arrayList.get(random.nextInt(count));
		}
		
		private int getWeight(ChannelGroup channelGroup) {
			return channelGroup.getWeight();
		}
		
	}), 
	
	ROUNDROBIN(new LoadBalance(){
		
		AtomicInteger position = new AtomicInteger(0);

		@Override
		public ChannelGroup select(CopyOnWriteArrayList<ChannelGroup> arrayList) {
			int count = arrayList.size();
			if (count == 0) {
				throw new IllegalArgumentException("empty elements for select");
			}
			if (count == 1) {
				return arrayList.get(0);
			}
			
			ChannelGroup channelGroup = arrayList.get(position.getAndIncrement() / count);
			
			return channelGroup;

		}
		
		
	});
	
	
	private final LoadBalance loadBalance;
	
	
	LoadBalanceStrategies(LoadBalance loadBalance) {
        this.loadBalance = loadBalance;
    }
	
	public ChannelGroup select(CopyOnWriteArrayList<ChannelGroup> arrayList){
		return loadBalance.select(arrayList);
	}
	
	interface LoadBalance {
		
		ChannelGroup select(CopyOnWriteArrayList<ChannelGroup> arrayList);
	}
	
	

}

这就是比较简单的负载均衡算法的实现，接下来的测试篇的文章会给出具体的测试结果