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.
+4
A:
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
Benjamin Cox
2009-11-09 23:37:05
this is a great example, but it isn't complete
mtasic
2009-11-10 10:05:59
in combination with http://www.bittorrent.org/beps/bep_0005.html was very useful for me!
mtasic
2009-11-10 18:41:42
+3
A:
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.
THC4k
2009-11-10 01:02:29
I have used __entagled__, and I totally agree with you that it isn't the greatest code, but it works. Which one do you prefer Kademlia or Chord?
mtasic
2009-11-10 10:02:09
I only worked with Kademlia, but I think Kademlia is a direct successors to Chord. It just has a simpler metric to find nodes and uses more parallelism in lookups.
THC4k
2009-11-10 16:20:19