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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Whānau is a novel routing protocol for distributed hash tables (DHTs) that is efficient and strongly resistant to the Sybil… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2007
2007
This paper presents an architecture called social distributed hash table (SDHT) that combines strengths of distributed hash table… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
DHash is a new system that harnesses the storage and network resources of computers distributed across the Internet by providing… (More)
  • table 1.1
  • figure 1-1
  • figure 1-2
  • figure 1-3
  • figure 1-4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity… (More)
  • figure 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide… (More)
  • figure 1
  • figure 4
  • figure 6
  • figure 7
  • figure 9
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and… (More)
  • table 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present Symphony, a novel protocol for maintaining distributed hash tables in a wide area network. The key idea is to arrange… (More)
Is this relevant?