79 search results - page 4 / 16 » Comparing the Performance of Distributed Hash Tables Under C... |
IMC
2006
ACM
15 years 3 months ago
2006
ACM
The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requir...
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...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Efficiently locating information in large-scale distributed systems is a challenging problem to which Peer-to-Peer (P2P) Distributed Hash Tables (DHTs) can provide a hi...
89
Voted
P2P
2007
IEEE
15 years 3 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 ...
102
click to vote
NDSS
2008
IEEE
15 years 3 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...