python 最容易实现的 DHT
声明：本页面是StackOverFlow热门问题的中英对照翻译，遵循CC BY-SA 4.0协议，如果您需要使用它，必须同样遵循CC BY-SA许可，注明原文地址和作者信息，同时你必须将它归于原作者（不是我）：StackOverFlow
原文地址: http://stackoverflow.com/questions/1704646/
Warning: these are provided under cc-by-sa 4.0 license. You are free to use/share it, But you must attribute it to the original authors (not me):
StackOverFlow
The easiest DHT to implement
提问by mtasic85
Which Distributed Hash Table (DHT) is easiest to implement in Python? Any good example that is not bloated?
哪个分布式哈希表 (DHT) 最容易在 Python 中实现？任何不臃肿的好例子？
I not am looking for a definition of DHT because I am more oriented and focused on design and implementation of such.
我不是在寻找 DHT 的定义，因为我更专注于设计和实现。
采纳答案by Benjamin Cox
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
如果您专注于实现，而不是寻找开箱即用的解决方案，这篇文章可能会有所帮助：http: //www.linuxjournal.com/article/6797
回答by Jochen Ritzel
In my job I'm working with entagled. I can't say it's great code, but it seems to be the only Kademliaimplementation for Python around.
在我的工作中，我与entangled一起工作。我不能说这是很棒的代码，但它似乎是Python 中唯一的Kademlia实现。
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.
我认为 Kademlia 已成为当今大多数应用程序的默认 DHT，因为它非常简单且具有快速查找功能。至少在我目前所见的学术界是如此。
