Paper Title:Zero hop Distributed Hash Table

Abstract

Hash tables use more structured key-based routing in order to attain both the decentralization of Freenet and gnutella, and the efficiency and guaranteed results of Napsterlevels, and in future comes with accurate measure of delivering millions of nodes and billions of threads of execution. A distributed hash Distributed table (DHT) is a class of a Storage decentralized distributed system that provides a lookup service similar to ahash table: (key, value) pairs are stored in a DHT, and any participating node can efficiently retrieve the value associated with a given key. DHTs form an infrastructure that can be used to build more complex services, such as anycast, cooperative systems. This allows a DHT to scale to extremely large numbers of nodes and to handle continual node arrivals, departures, and failures. Distributed hash tables use a more structured key-based routing in order to attain both the decentralization of Freenet and gnutella, and the efficiency and guaranteed results of Napster. The primary goal of ZHT is to provide excellent storage systems have availability, fault tolerance, high throughput, and low latencies.


Keywords:Distributed hash tables, key/value stores, high-end computing