Date Added: Jun 2010
Distributed hash table algorithms construct structured P2P networks to control the communication cost of resource lookups. Resource or content lookups in DHT protocols are performed based on a key that is a hash print of the searched content. Nodes and keys are mapped on an IDentifier (ID) space, and the distance between the key and the node performing the lookup is determined. Usually, the protocols employ a greedy forwarding mechanism to forward the lookup to the owner of the key.