Feat: Incorporating Geographical Distance or Network Latency in DHT #75
Labels
kind/enhancement
New feature or request
scope/nicetohave
Nice to have feature going beyond go-libp2p-kad-dht
Hi,
I've been recently discussing a specific use-case scenario with the libp2p community that revolves around the concept of locality in DHT (Distributed Hash Table) and content routing. In our particular use-case, the geographical distance or network latency between nodes is of utmost importance and it's a key factor that we cannot afford to overlook.
Currently, as far as I'm aware, the libp2p.contentRouting.findProviders(CID) returns the closest nodes based purely on XOR distance between the CID and the peer-id. While this is great for most applications, it lacks the locality-preserving feature that would allow us to account for geographical distance or network latency.
It was suggested to me by yiannis in our conversation that these thoughts could be added as a feature request for the ongoing DHT refactoring work. Hence, I'm opening this issue.
Thanks,
The text was updated successfully, but these errors were encountered: