最容易实现的 DHT
哪种分布式哈希表 (DHT) 最容易在 Python 中实现?有什么不臃肿的好例子吗?
我并不是在寻找 DHT 的定义,因为我更倾向于并专注于 DHT 的设计和实现。
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.
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(4)
在我的工作中,我正在与纠缠一起工作。我不能说这是很棒的代码,但它似乎是 Python 的唯一 Kademlia 实现。
我认为 Kademlia 已经成为当今大多数应用程序的默认 DHT,因为它非常简单并且查找速度很快。至少在我迄今为止所见的学术界是这样。
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.
如果您专注于实现,而不是寻找开箱即用的解决方案,本文可能会有所帮助:http://www.linuxjournal.com/article/6797
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
您可能想查看 DHTBot。它是 BitTorrent MDHT 的 Python 实现,并使用高级 Python 网络库 Twisted 编写。
(**免责声明:我是 DHTBot 的作者)
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)
您还可以检查btdht,它不使用twisted,对于嗅探Bittorrent DHT很有用。
You may also check btdht that doesn't use twisted and is useful to sniff Bittorrent DHT.