456 search results - page 1 / 92 » On Routing in Distributed Hash Tables |
P2P
2007
IEEE
13 years 10 months ago
2007
IEEE
An important security issue in DHT-based structured overlay networks is to provide anonymity to the storage nodes. Compromised routing tables in those DHTs leak information about ...
P2P
2007
IEEE
13 years 10 months ago
2007
IEEE
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
P2P
2007
IEEE
13 years 10 months ago
2007
IEEE
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
PODC
2003
ACM
13 years 9 months 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...
P2P
2006
IEEE
13 years 10 months ago
2006
IEEE
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...