Crates.io | consistent_hashing |
lib.rs | consistent_hashing |
version | 0.5.0 |
source | src |
created_at | 2020-08-10 03:39:44.218182 |
updated_at | 2020-08-21 04:23:25.504828 |
description | ConsistentHashing Alogrithm in Rust |
homepage | |
repository | |
max_upload_size | |
id | 274902 |
size | 10,215 |
Consistent Hashing is a distributed system algorithm for assigning values to partitions in a highly dynamic environment.
Using the algorithm to LB redis cache. (Crate redis = "0.17.0"
).
While the key must implement the hash trait to define a hashing strategy.
The Value must implement the Evict trait to define rebalancing behavior.
let mut ring: ConsistentHash<String,redis::Client> = match ConsistentHash::new(100).unwrap();
ring.add_node("redis://my-redis-node-1".to_string(), redis::Client::open("redis://my-redis-node-1")?).unwrap();
ring.add_node("redis://my-redis-node-2".to_string(), redis::Client::open("redis://my-redis-node-2")?).unwrap();
ring.add_node("redis://my-redis-node-3".to_string(), redis::Client::open("redis://my-redis-node-3")?).unwrap();
ring.add_node("redis://my-redis-node-4".to_string(), redis::Client::open("redis://my-redis-node-4")?).unwrap();
let client = match ring.get_node(String::from("some-key")){
Some(node) => node,
None => panic!("Not found!"),
};
let mut con = client.get_connection()?;
con.get("some-key");