447 search results - page 9 / 90 » On the Distribution of Nodes in Distributed Hash Tables |
76
Voted
NCA
2006
IEEE
15 years 3 months ago
2006
IEEE
Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to pr...
P2P
2007
IEEE
15 years 3 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 ...
89
Voted
SAINT
2006
IEEE
15 years 3 months ago
2006
IEEE
Despite the scalability, availability and resiliency potential suggested by Distributed Hash Tables, their lack of support for replication of mutable data and for strong consisten...
EDBTW
2004
Springer
15 years 2 months 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...
PODC
2003
ACM
15 years 2 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...