447 search results - page 1 / 90 » On the Distribution of Nodes in Distributed Hash Tables |
KIVS
2005
Springer
13 years 10 months ago
2005
Springer
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
IPTPS
2003
Springer
13 years 10 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...
EUROMICRO
2006
IEEE
13 years 11 months ago
2006
IEEE
Most existing DHT algorithms assume that all nodes have equal capabilities. This assumption has previously been shown to be untrue in real deployments, where the heterogeneity of ...
BROADCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These eve...
NDSS
2008
IEEE
13 years 11 months ago
2008
IEEE
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...