一致性哈希算法 Java实现

import java.util.*;

public class ConsistencyHash {
    private static final int VIRTUAL_MACHINE_NUMBER = 5 ;
    private SortedMap<Integer,String> virtualNodeMap = new TreeMap<Integer, String>();
    private  List<String> trueNodeList = new ArrayList<String>();
    public void addNode(String node){
        if(trueNodeList.contains(node)){
            return;
        }
        trueNodeList.add(node);
        for(int i=0;i<VIRTUAL_MACHINE_NUMBER;i++){
            String virtualNodeName = node + i;
            int hash = getHash(virtualNodeName);
            virtualNodeMap.put(hash,virtualNodeName);
        }
    }

    /**
     * 删除某个节点
     * @param node
     */
    public void delNode(String node){
        trueNodeList.remove(node);
        for(int i=0;i<VIRTUAL_MACHINE_NUMBER;i++){
            String virtualNodeName = node + i;
            int hash = getHash(virtualNodeName);
            virtualNodeMap.remove(hash);
        }
    }

    /**
     * FNV哈希算法
     * @param key
     * @return
     */
    public int getHash(String key){
        int p = 16777619;
        int hash = (int)2166136261L;
        for(int i=0;i<key.length();i++){
            hash=(hash^key.charAt(i))*p;
        }
        hash+=hash<<13;
        hash^=hash>>7;
        hash+=hash<<3;
        hash^=hash>>17;
        hash+=hash<<5;
        return hash>0?hash:Math.abs(hash);
    }

    public String getServer(String key){
        int hash = getHash(key);
        SortedMap<Integer, String> tailMap = virtualNodeMap.tailMap(hash);
        int nodeKey;
        if(tailMap.isEmpty()){
            nodeKey=virtualNodeMap.firstKey();
        }else{
            nodeKey=tailMap.firstKey();
        }
        String virtualNodeName = virtualNodeMap.get(nodeKey);
        return virtualNodeName.substring(0,virtualNodeName.length()-1);
    }

    public static void main(String[] args) {
        ConsistencyHash consistencyHash = new ConsistencyHash();
        String[] nodes = {"192.168.1.1","192.168.1.2","192.168.1.3"};
        for(String node:nodes){
            consistencyHash.addNode(node);
        }
        Map<String,List<Integer>> taskDistributionMap = new HashMap();
        for(int i=0;i<100;i++){
            String server = consistencyHash.getServer("abc"+i + "def" );
            List<Integer> list = taskDistributionMap.get(server);
            if(list==null){
                list = new ArrayList<>();
                taskDistributionMap.put(server,list);
            }
            list.add(i);
        }
        for(Map.Entry<String,List<Integer>> entry:taskDistributionMap.entrySet()){
            System.out.print(entry.getKey()+" "+entry.getValue().size()+" tasks:");
            for(int t:entry.getValue()){
                System.out.print(t+" ");
            }
            System.out.println();
        }
        consistencyHash.addNode("192.168.1.4");
        taskDistributionMap = new HashMap();
        for(int i=0;i<100;i++){
            String server = consistencyHash.getServer("abc"+i + "def" );
            List<Integer> list = taskDistributionMap.get(server);
            if(list==null){
                list = new ArrayList<>();
                taskDistributionMap.put(server,list);
            }
            list.add(i);
        }
        for(Map.Entry<String,List<Integer>> entry:taskDistributionMap.entrySet()){
            System.out.print(entry.getKey()+" "+entry.getValue().size()+" tasks:");
            for(int t:entry.getValue()){
                System.out.print(t+" ");
            }
            System.out.println();
        }

    }
}

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值