Distributed hash table

Known as: Distributed sloppy hash table, Distributed hashtable, Network 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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2008

Distributed hash tables (DHTs) are commonly used in wired peer-to-peer networks for various purposes. However, implementing a DHT…

2007

Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in large scale distributed systems, e.g. P2P systems…

2007

There have been many proposals for constructing routing tables for distributed hash tables (DHT). They can be classified into two…

2006

Distributed hash tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the…

2006

For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to…

2006

Distributed hash tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer…

2005

In the last few years, an increasing number of massively distributed systems with millions of participants has emerged within…

2005

In this paper, the authors introduced topology-based distributed hash tables (T-DHT) as an infrastructure for data-centric…

2003

Learn the fundamental technique behind the next generation of privacy-conscious peer-to-peer systems.

2003

We present two broadcast algorithms that can be used on top of distributed hash tables (DHTs) to perform group communication and…