Stack Overflow
Stack Overflow

Questions tagged [dht]

A Hash Table is a data structure used to store data in the form of Key=>Value pairs. A Distributed Hash Table (DHT) is basically a hash table distributed across a network of computers(nodes). A DHT uses a Routing Protocol to determine which node to store a piece of data on.

A distributed hash table (DHT) is a class of a decentralized distributed system that provides a lookup service similar to a hash table; (key, value) pairs are stored in a DHT, and any participating node can efficiently retrieve the value associated with a given key. Responsibility for maintaining the mapping from keys to values is distributed among the nodes, in such a way that a change in the set of participants causes a minimal amount of disruption. This allows a DHT to scale to extremely large numbers of nodes and to handle continual node arrivals, departures, and failures.

A DHT uses a Routing Protocol to determine which node(s) a data should be stored on. This routing protocol usually takes care of replicating data and also updating data stores to make sure that the data survives on the DHT for the long term. Some popular routing protocols are Kademlia, Chord and Pastry

275 questions
0
votes
1 answer

Could a Distributed Hash Table (DHT) be used for a dynamic web application? Another P2P design?

Could a Distributed Hash Table be used for a two-way web app with a pub/sub type application? I'm investigating building a forum type application but with a DHT architecture and P2P (although a central lookup server would be OK to improve…
user349284
  • 1
  • 1
0
votes
1 answer

How to get updated data in a DHT? IE, dealing with timestamp keys

I have a distributed application where I need to get updated information from other clients, continuously. The only solution I can think of is to make timestamp based keys, so that updates/puts to the DHT would be of the form: [long millis, data] So…
dessalines
  • 6,352
  • 5
  • 42
  • 59
0
votes
1 answer

Node discovery in Distributed hash table

I am quite confused about how node discovery is made in Distributed Hash Table algorithms (CHORD). Suppose every node is reachable via multicast. Why would the following scenario be bad: One node starts working Multicasts arrival to the…
Ozum Safa
  • 1,458
  • 2
  • 15
  • 27
0
votes
1 answer

Order-keeping queues that can be paused

I am currently working on a software that uses RabbitMQ to deliver messages to workers. Basically, this is quite an easy task, as you can use a single direct exchange with a single queue, and all the workers consume that queue. Job done. But now,…
Golo Roden
  • 140,679
  • 96
  • 298
  • 425
0
votes
1 answer

Setting-up an open-source decentralized social-network

I am trying to build an open-source decentralized social network, created and supported by the community (Facebook like). Using Datastax Enterprise/Cassandra it is possible to setup a working DHT (Distributed hash table) to store the large amount of…
Melroy van den Berg
  • 2,697
  • 28
  • 31
0
votes
2 answers

dht does not name a type error

when I am compiling this code, i got the error "dht does not name a type" #include #include dht DHT; #define DHT22_PIN 5 void setup() { Serial.begin(9600); Serial.println("DHT TEST PROGRAM "); …
Dushyant Kumar Singh
  • 1
  • 1
  • 1
  • 3
0
votes
1 answer

Identification in a distributed p2p network

SCENARIO: a P2P distributed network in which users connect by a DHT. They identify themselves by a hexadecimal 76-character string. PROBLEM: users need to choose their own ID, not have a really long and random one assigned to them. And with security…
user3494880
  • 1
0
votes
1 answer

Chord DHT response method

I am building a Chord DHT in Go (however the language part isn't important). And I am trying to figure out the response behavior between nodes. If I want to send a successor request message to Node C, but it has to go to Node A -> Node B first, then…
John-Alan
  • 171
  • 7
0
votes
1 answer

Where would a Distributed Hash Table be used in place of BitTorrent?

The lack of recent research into the field of DHTs in comparison to BitTorrent (Tribler being the most significant research project) has lead me to wonder about the usage of DHTs. Both BitTorrent and Distributed Hash Tables provide a method for…
liamzebedee
  • 14,010
  • 21
  • 72
  • 118
0
votes
1 answer

Get list of nodes in pastry overlay

Please, how can i get the list of nodes in pastry overlay ? is that possible ? Thank you.
Chercheur Chercheur
  • 37
  • 5
0
votes
1 answer

Chord p2p distributed hash table (dht) implementation over http protocol

I have to implement the chord protocol over http as my project until now I've considered three ways: Using jxta in java Try to edit open-chord [which uses tcp/ip] Coding from scratch using sockets in java Any help?
shivam atri
  • 3
  • 1
  • 3
0
votes
2 answers

Calculate total number of actual seeders

I'm creating a PHP torrent scraper based on the info hash of torrents. I managed to get the number of seeds and peers per torrent on a lot of trackers. But how do I calculate the 'average' number of seeds? Is there something I can do with DHT maybe?
Notopic
  • 82
  • 1
  • 6
0
votes
1 answer

Libtorrent Logging through python bindings, possible?

I noticed the Rasterbar/Libtorrent page mentions the possiblity of "verbose logging of the DHT protocol traffic" http://www.rasterbar.com/products/libtorrent/building.html Does anyone know if its possible to do with the python bindings? Cheers!
harold
  • 21
  • 2
0
votes
1 answer

DHT in P2P systems

In a P2P system, what is a difference between: send a query message to a known node and the node re-send a response(I mean I explicitly contact a node by sending a message to ask him somethings). if there is a DHT which contains information about…
jojo
  • 333
  • 2
  • 13
-1
votes
1 answer

How do I fetch the metadata of a torrent using an Infohash?

I am assuming that after finding peers using that Infohash you send handshake messages until one peer establishes a connection. But I can't seem to find any packet in Wireshark that has the metadata in it. If possible can you show me how a metadata…
orraz1
  • 43
  • 5
1 2 3
…
18
19