《日子》.java实现hash一致性算法


import java.io.UnsupportedEncodingException;
import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
import java.util.*;

public class ConsistencyHash {
private TreeMap nodes = null;
//真实服务器节点信息
private List shards = new ArrayList();
//设置虚拟节点数目
private int VIRTUAL_NUM = 4;

// 初始化一致环
public void init() {
shards.add("192.168.0.0-服务器0");
shards.add("192.168.0.1-服务器1");
shards.add("192.168.0.2-服务器2");
shards.add("192.168.0.3-服务器3");
shards.add("192.168.0.4-服务器4");
nodes = new TreeMap();
for(int i=0; i Object shardInfo = shards.get(i);
for(int j=0; j nodes.put(hash(computeMd5("SHARD-" + i + "-NODE-" + j),j), shardInfo);
}
}
}

// 根据key的hash值取得服务器节点信息
public Object getShardInfo(long hash) {
Long key = hash;
SortedMap tailMap=nodes.tailMap(key);
if(tailMap.isEmpty()) {
key = nodes.firstKey();
} else {
key = tailMap.firstKey();
}
return nodes.get(key);
}
// 打印圆环节点数据
public void printMap() {
System.out.println(nodes);
}
//根据2^32把节点分布到圆环上面。
public long hash(byte[] digest, int nTime) {
long rv = ((long) (digest[3+nTime4] & 0xFF) << 24)
| ((long) (digest[2+nTime
4] & 0xFF) << 16)
| ((long) (digest[1+nTime4] & 0xFF) << 8)
| (digest[0+nTime
4] & 0xFF);
return rv & 0xffffffffL; /* Truncate to 32-bits */
}
//计算MD5值
public byte[] computeMd5(String k) {
MessageDigest md5;
try {
md5 = MessageDigest.getInstance("MD5");
} catch (NoSuchAlgorithmException e) {
throw new RuntimeException("MD5 not supported", e);
}
md5.reset();
byte[] keyBytes = null;
try {
keyBytes = k.getBytes("UTF-8");
} catch (UnsupportedEncodingException e) {
throw new RuntimeException("Unknown string :" + k, e);
}
md5.update(keyBytes);
return md5.digest();
}
public static void main(String[] args) {
Random ran = new Random();
ConsistencyHash hash = new ConsistencyHash();
hash.init();
hash.printMap();
for(int i=0; i<20; i++) {
System.out.println(hash.getShardInfo(hash.hash(hash.computeMd5(String.valueOf(UUID.randomUUID().toString())),ran.nextInt(hash.VIRTUAL_NUM))));
}
}
}

你可能感兴趣的:(《日子》.java实现hash一致性算法)