Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An effective distributed network requires an addressing mechanism and distribution of data that is designed to overcome churn… 
2010
2010
Kademlia is a peer-to-peer distributed hash table (DHT) currently used in the P2P eDonkey le sharing network. The most popular… 
2008
2008
A novel distributed Hash table(DHT) BChord was presented. BChord adopts bi-directional search mechanism of Chord. Though query… 
2006
2006
By randomly mapping items and nodes to a common address space, most P2P index structures based on DHTs provide only exact match… 
2004
2004
To meet the demands of new Internet applications, recent work argues for giving end-hosts more control over routing. To achieve… 
2003
2003
We present two broadcast algorithms that can be used on top of distributed hash tables (DHTs) to perform group communication and… 
2000
2000
This paper presents a new efficient design for the one-dimensional (1-D) any-length discrete Hartley transform (DHT). Using a… 
1993
1993
Fast algorithms for computing the DHT of short transform lengths (N = 2, 3, 4, 5, 7, 8, 9 and 16) are derived. A new prime-factor… 
1991
1991
A new method of implementing FIR adaptive filters using the discrete Hartley transform (DHT) and the overlap-save method is… 
Highly Cited
1987
Highly Cited
1987
A new factorization of the discrete Hartley transform (DHT) is presented. It is used to derive new algorithms for the DHT and the…