DataTerminology.comNEW
Also known as: DHT
A decentralized lookup structure mapping keys to values across networked nodes with efficient, fault-tolerant routing.
DESCRIPTION
A Distributed Hash Table (DHT) provides a hash-table-like interface in a peer-to-peer network, distributing key-value responsibility across nodes. Nodes cooperate using structured overlays (e.g., ring or XOR metric) to route queries in O(log n) hops. DHTs enable scalable, robust indexing and discovery without central servers and are used in BitTorrent, distributed storage, and content-addressed systems. Protocols like Chord and Kademlia define consistent routing, replication, and churn handling.
ALTERNATIVE DEFINITIONS
Wikipedia
A distributed hash table (DHT) is a class of decentralized distributed systems that provide a lookup service similar to a hash table: (key, value) pairs are stored, and any participating node can efficiently retrieve the value associated with a given key.
Stresses decentralized design and hash-table-like lookup semantics.
BitTorrent Enhancement Proposals
The DHT provides a mapping from info-hash values to lists of IP address and port pairs of peers currently participating in the sharing of that torrent.
Concretely defines DHT use for peer discovery in BitTorrent.
MIT CSAIL (Chord Paper)
Chord is a distributed lookup protocol that provides a mapping between keys and nodes in a peer-to-peer system.
Introduces ring-based consistent hashing for scalable key-node mapping.
RELATED TERMS
Peer-to-Peer Kademlia Chord Consistent Hashing BitTorrent Key-Value Store Gossip Protocol Distributed Systems Overlay Network CAP Theorem
COMPETING TERMS
Centralized Lookup Service Tracker-based Indexing
RELATIONS
- Broader: Hash Table
KNOWLEDGE AREAS
Data Engineering Real-time & Streaming Data Infrastructure Data Storage & Operations Cloud
TARGET AUDIENCE
Software Developer Data Engineer Cloud Architect DevOps Engineer
EXTERNAL SOURCES
- Wikipedia - Distributed hash table
- BitTorrent - Mainline DHT protocol specification
- MIT CSAIL - Chord peer-to-peer lookup paper
- Rice University (Kademlia Paper) - Kademlia DHT paper with XOR metric
TOP QUESTIONS
Why are Distributed Hash Tables used in peer-to-peer networks?
DHTs remove central points of failure while providing scalable, efficient lookup. They handle churn and distribute responsibility across many nodes.
Category: Relevancy
How does routing work in a DHT like Kademlia?
Nodes use the XOR metric to route queries toward nodes whose identifiers are progressively closer to the key, yielding O(log n) hops.
Category: HowTo
What is the biggest misunderstanding about DHTs?
Many assume DHTs guarantee strong consistency, but most implementations favor eventual consistency and resilience over strict guarantees.
Category: Misunderstanding
What are typical failure handling strategies in DHTs?
Replication, periodic refresh, and routing table maintenance address node churn and transient network faults.
Category: Requirements
What are competing alternatives to a Distributed Hash Table?
Centralized lookup services or trackers offer simpler management but introduce bottlenecks and single points of failure.
Category: Alternatives
How do DHTs relate to consistent hashing?
Consistent hashing partitions keyspace among nodes and limits remapping when nodes join or leave, a principle widely used by DHTs.
Category: Overview
What is a hot topic around Distributed Hash Tables today?
Using DHTs in decentralized storage and content addressing (e.g., IPFS-like systems) and optimizing for mobile and edge environments.
Category: Topic
What are common mistakes when implementing a DHT?
Ignoring security, not handling churn adequately, and poorly tuned timeouts can degrade reliability and performance.
Category: Mistakes
How do I start learning about DHTs?
Read the Chord and Kademlia papers, examine BEP-0005, and experiment with open-source libraries in test networks.
Category: Learning