2.11.3 Chord - A Distributed Hash Table Example

• When the name of the object is known, there are more efficient search structures, such as Hash Tables.
• A hash table takes an input key k, calculates the hash function on the key h(k), and uses this as an index into a table.
• In a distributed hash table, the table into which h(k) indexes is distributed across the nodes in the DHT.
• The key is provided, the hash function is calculated h(k), and h(k) is used to route to the node which would hold the object corresponding to the key.