Ask HN: What's a good algorithm to distribute data in a P2P network
I'm on the search for a good algorithm (no implementation needed) that distributes data in a P2P network. The goal should be to maximize availability.
Best solution is to overlay a distributed hash table as k-v store over the p2p network. Nodes can then query that instead of each other. You can make your implementation more robust by exploiting and rewarding nodes in the network that have faster net connections, more compute power, etc. Best of luck!
OpenDHT: A C++11 Distributed Hash Table implementation