346 search results - page 13 / 70 » Routing networks for distributed hash tables |
IPTPS
2003
Springer
15 years 2 months ago
2003
Springer
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
NBIS
2007
Springer
15 years 3 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
52
Voted
NETWORK
2008
14 years 9 months ago
2008
IPTPS
2003
Springer
15 years 2 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
82
Voted
GI
2004
Springer
15 years 2 months ago
2004
Springer
Abstract: Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics ...