Quick wins for a faster PC:
Clear out junk files and repair common Windows errorsFree Scan →Scan for outdated or missing drivers - takes under a minuteDriver Scan →A distributed hash table (DHT) is a peer-to-peer lookup system that spreads an index across participating computers. It assigns identifiers to keys and peers, then routes a lookup through the network to the peer responsible for a key—without requiring a central index. A DHT locates information; it does not necessarily store the information itself or guarantee that it remains available.
What does “distributed hash table” mean?
A DHT is a software data structure and routing protocol that provides hash-table-like lookup across an overlay network. In an ordinary hash table, a key maps to a value in one machine’s memory. In a DHT, participating peers share responsibility for the index: a rule maps each key to one or more peers, and those peers help answer requests for that key. The Internet Architecture Board distinguishes a distributed index from a centralized index and from a local index that records only a peer’s own data (RFC 5694).
| # | Preview | Product | Price | |
|---|---|---|---|---|
| 1 |
|
Distributed Systems | $32.68 | Buy on Amazon |
| 2 |
|
Understanding Distributed Systems, Second Edition: What every developer should know about large... | $32.41 | Buy on Amazon |
| 3 |
|
Distributed Systems | $35.00 | Buy on Amazon |
| 4 |
|
Foundations of Scalable Systems: Designing Distributed Architectures | $42.49 | Buy on Amazon |
| 5 |
|
Distributed Systems: Concepts and Design | $255.63 | Buy on Amazon |
As an Amazon Associate I earn from qualifying purchases.
Think of a directory split among many cooperating librarians. A lookup rule identifies which librarian should handle a request, and each librarian knows enough about other librarians to forward it closer to the right place. The DHT is that distributed directory and routing method—not necessarily the books, files, or other content listed in it.
How does a DHT find a key?
- Assign identifiers. The system represents keys and participating peers in a shared logical identifier space.
- Assign responsibility. Its rules associate a key or range of keys with one or more responsible peers.
- Route the request. A requester sends a lookup into the overlay. Peers use their routing information to forward it toward the peer responsible for that identifier.
- Return a result or reference. The responsible peer can answer the index lookup. The application may then use the result to contact a separate location where the content is held.
The requester does not need a complete list of every peer. In RELOAD’s Chord-based example, peers and resource identifiers occupy positions on a ring; a peer is responsible for a range, and neighbor and finger tables guide routing (RFC 6940).
#1 Best Overall
Chord is one example, not the definition
Chord organizes identifiers around a ring. Its finger table provides routing shortcuts around that ring. RFC 6940 describes the structure as skip-list-like and says that it can find entries in O(log(N)) time, compared with O(N) traversal of a typical linked list, where N is the number of nodes in the DHT. This is a complexity statement about the specified Chord structure, not a measured speed guarantee for every DHT or real-world network.
Other DHT designs use different identifier geometries, distance rules, routing state, and lookup procedures. The IETF security analysis names Chord, Kademlia, and Pastry among the DHT algorithms it discusses; a ring is therefore one design choice rather than a defining feature of all DHTs (RFC 5765).
Is a DHT the same as peer-to-peer storage?
No. A DHT distributes the index used to locate keys and route lookups. A peer-to-peer application may store content across peers, but the DHT alone does not mean the full content is stored in the index or on the peer responsible for the key. The application’s storage and retrieval design determines where the content lives and what happens when a peer holding it is offline.
Are DHTs reliable and secure?
Peer departures and replication
Peers can join or leave, so a DHT has to keep its routing information usable as the overlay changes. Replication may help preserve access when peers fail, but the protection depends on the design. For example, RFC 6940 says sequential replicas in Chord-RELOAD protect against peer failure, but not against malicious peers.
Rank #3
Malicious identities
A DHT is not automatically secure just because it is distributed. RFC 5765 describes Sybil attacks, in which an adversary presents multiple identities in an overlay and can undermine redundancy. A system needs appropriate security measures in addition to its lookup algorithm; replication by itself does not address every attack.
Quick Recap
Best Value
What to remember
- A DHT distributes an index and lookup work among peers rather than relying on one central index.
- A key-to-peer assignment rule and multi-hop routing let a requester find the responsible peer without knowing every node.
- The DHT locates keys; it does not, by definition, store the content those keys identify.
- Chord’s ring and finger table are one concrete design. Lookup behavior, maintenance, replication, and security differ among DHTs.
Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on Amazon at the time of purchase will apply.
