Distributed Hash Table

A distributed hash table (DHT) is a class of a decentralized 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. 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.

DHTs form an infrastructure that can be used to build more complex services, such as anycast, cooperative Web caching, distributed file systems, domain name services, instant messaging, multicast, and also peer-to-peer file sharing and content distribution systems. Notable distributed networks that use DHTs include BitTorrent's distributed tracker, the Coral Content Distribution Network, the Kad network, the Storm botnet, and the YaCy search engine.

Read more about Distributed Hash Table:  History, Properties, Structure, DHT Implementations

Famous quotes containing the words distributed and/or table:

    Taking food alone tends to make one hard and coarse. Those accustomed to it must lead a Spartan life if they are not to go downhill. Hermits have observed, if for only this reason, a frugal diet. For it is only in company that eating is done justice; food must be divided and distributed if it is to be well received.
    Walter Benjamin (1892–1940)

    But hospitality must be for service, and not for show, or it pulls down the host. The brave soul rates itself too high to value itself by the splendor of its table and draperies. It gives what it hath, and all it hath, but its own majesty can lend a better grace to bannocks and fair water than belong to city feasts.
    Ralph Waldo Emerson (1803–1882)