decanus / bureka

Pastry DHT implementation with a standalone libp2p compatible node

Hi there 👋

• 💬 Ask me about anything about computer stuff.
• 📫 You can reach me on my website.

bureka's Issues

Simulation-ability

Problem

The current code is closely bound to libp2p, this makes it hard to test without libp2p, makes it hard to simulate etc.

Solution

Abstract away IO, eg libp2p making the core of the algorithm (DHT) use plugable interfaces, these can wrap around various transports.

Notes

• http://sled.rs/simulation

proximity metric

The NeighborhoodSet stores the closest nodes based on a specific proximity metric, we currently do not have this so the NeighborhoodSet stores all nodes. this should change.

Set Size

We probably need to be able to limit the set size, and only add an element if it is in the range. Pop out the other.

Remove Send function for Channel

Replace the send function with a channel that takes in messages and disseminates them to the node that will send them. This will probably clean up a good chunk of the code.

Close function

We need a close function on the DHT that sends a message to its neighbours that the node is leaving.