I want to us开发者_高级运维e a distributed hash table in an application but I don\'t want to have a central server as entry point. Is there a way to implement this?Yes, there are quite a few ways:
I grabbed the basic idea about DHT from wiki: Store Data: In a DHT-network, every node is responsible for a specific range of key-space. To store a file in the DHT, first, hash the file\'s name to g
Can somebody clarify me the statement from the specification of mainline DHT? Upon inserting the first node into its routing table and when starting up thereafter, the node should attempt to find th
What is the maximum size of the udp packet which is sent by the mainline DHT node for the get_peers query?
What does the \'v\' key value correspond to in Bittorrent Mainline DHT (MDHT) responses? Here\'s an example buncoded 开发者_运维技巧response:
As I understand the first lookup request is sent to the node which开发者_如何学JAVA is the closest one in the routing table to the info hash of the torrent
Im trying to get access to a Torrent DHT network, and im having a hard time figuring out howto get access to the \"entry\" node i开发者_运维百科n DHT.
Ive been playing around with the pyth开发者_运维百科on bindings for libtorrent/rasterbar. What I wanted to do was generate a new \'node-id\' and reannounce it to the other nodes.
I am looking for opensource implementations of 开发者_StackOverflowKademlia DHT in C/C++. It must be lightweight and crossplatform (win/linux/mac).
I am familiar with the theory of how 开发者_如何学运维a Distributed Hash Table (DHT) works. Is it possible to write a program that stores data to an existing DHT (such as Kademlia or Mainline DHT) ? I
加载中,请稍侯......