447 search results - page 29 / 90 » On the Distribution of Nodes in Distributed Hash Tables |
115
Voted
ANSS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper describes a secure and reliable method for storing data in a distributed hash table (DHT) leveraging the inherent properties of the DHT to provide a secure storage subs...
108
click to vote
WETICE
2009
IEEE
15 years 6 months ago
2009
IEEE
The ever growing request for digital information raises the need for content distribution architectures providing high storage capacity, data availability and good performance. Wh...
ICPP
2008
IEEE
15 years 6 months ago
2008
IEEE
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
ICPADS
2005
IEEE
15 years 5 months ago
2005
IEEE
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
107
click to vote
COREGRID
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the problem of atomic commit in transactional database systems built on top of Distributed Hash Tables. Therefore we present a framework for DHTs to provide strong d...