343 search results - page 5 / 69 » Weighted distributed hash tables |
195
Voted
ISCC
2006
IEEE
16 years 1 months ago
2006
IEEE
Most research on Distributed Hash Tables (DHTs) assumes ephemeral, lightly loaded deployments. Each node has a lifetime of a few hours and initiates a lookup once every few second...
229
Voted
IPTPS
2003
Springer
16 years 20 days 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...
207
Voted
IPTPS
2004
Springer
16 years 25 days ago
2004
Springer
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
195
click to vote
EDBTW
2004
Springer
16 years 26 days ago
2004
Springer
The two main approaches to find data in peer-to-peer (P2P) systems are unstructured networks using flooding and structured networks using a distributed index. A distributed index i...
181
Voted
PODC
2003
ACM
16 years 22 days ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...