Everything About ___
Live briefing

Everything about Distributed hash table

Decentralized distributed system with lookup service

A distributed hash table (DHT) is a 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. The main advantage of a DHT is that nodes can be added or removed with minimum work around re-distributing keys. Keys are unique identifiers which map to particular values, which in turn can be anything from addresses, to documents, to arbitrary data. 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. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Distributed hash tableA 5-minute orientation
  2. Skim a recent paper: 6G-DeFLI: enhanced quality-of-services using distributed hash table and blockchain-enabled federated learning approach in 6G IoT networksInfluential work since 2022
  3. Pick up a classic book: Database system conceptsThe most-reprinted book on the subject
  4. Read the landmark paper: Distributed Hash table-based routing and data management in wireless sensor networks: a surveyCited 38 times
  5. Go sideways: KademliaA closely related topic
  6. Go sideways: Tapestry (DHT)A closely related topic

📖 Definitions

Noun A decentralised distributed system that performs the functions of a hash table.

🗂️ The subject at a glance

  1. History
  2. Properties
  3. Structure
  4. Security
  5. Implementations
  6. Examples

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics