问题
Which Distributed Hash Table (DHT) is easiest to implement in Python? Any good example that is not bloated?
I not am looking for a definition of DHT because I am more oriented and focused on design and implementation of such.
回答1:
If you are focused on implementation, rather than looking for an out-of-the-box solution, this article might help a bit: http://www.linuxjournal.com/article/6797
回答2:
In my job I'm working with entagled. I can't say it's great code, but it seems to be the only Kademlia implementation for Python around.
I think Kademlia has become the default DHT for most applications today, because it's quite simple and has fast lookups. At least in the academic world that I've seen so far.
回答3:
You might want to check out DHTBot. It's a python implementation of the BitTorrent MDHT and is written using twisted, a high-level python networking library.
(**Disclaimer: I am the author of DHTBot)
回答4:
You may also check btdht that doesn't use twisted and is useful to sniff Bittorrent DHT.
来源：https://stackoverflow.com/questions/1704646/the-easiest-dht-to-implement