#dht #grpc #protocols #node #communication #algorithm #pastry

pastry-dht

A Pastry DHT protocol implementation in Rust

8 releases

0.1.7 Nov 13, 2023
0.1.6 Nov 13, 2023

#24 in #dht

Custom license

110KB
2.5K SLoC

Pastry

A reusable Pastry DHT protocol implementation using gRPC for node communication.

Refer to the Pastry paper for the algorithm.

Usage

Install with cargo:

cargo install pastry-dht

or include in Cargo.toml pastry-dht = "*".

Example

Running a simple PastryNode with parameter k=8:

Create a binary for the node server

#[tokio::main]
async fn main() -> Result<(), Box<dyn std::error::Error>> {
    let args: Vec<String> = std::env::args().collect();
    let addr = args.get(1).unwrap().parse()?;
    let bootstrap_addr = args.get(2).map(|s| s.as_str());

    env_logger::Builder::from_default_env()
        .filter_level(log::LevelFilter::Info)
        .init();

    Ok(PastryNode::new(Config::new(8), addr, addr)?
        .bootstrap_and_serve(bootstrap_addr)
        .await?)
}

Run in three different terminals

  1. cargo run 0.0.0.0:50000
  2. cargo run 0.0.0.0:50001 http://0.0.0.0:50000
  3. cargo run 0.0.0.0:50002 http://0.0.0.0:50001

This will spin up a 3-node network.

Now, create a binary for the client: using PastryClient we connect to a node and send a request

#[tokio::main]
async fn main() -> Result<(), Box<dyn std::error::Error>> {
    let args: Vec<String> = std::env::args().collect();
    let node_addr = args.get(1).unwrap();

    let mut client = PastryClient::connect(&node_addr).await?;

    client.set_kv("pastry".as_bytes(), "rocks!".as_bytes()).await?;
    let value = client.get_kv("pastry".as_bytes()).await?;
    println!("Value read from Pastry network: {}", String::from_utf8(value.unwrap())?);
    Ok(())
}

Finally, in another terminal execute cargo run http://0.0.0.0:50001.

This should print 'Value read from Pastry network: rocks!'

TODO

  • Create Leaf set/Routing table structures
  • Handle node arrivals (Join)
  • Handle get/set/delete queries (Query)
  • Handle node failures
  • Handle range queries
  • Handle concurrent node arrivals
  • Handle concurrent node failures
  • Handle data replication

Dependencies

~10–18MB
~235K SLoC