79 search results - page 2 / 16 » Comparing the Performance of Distributed Hash Tables Under C... |
SIGCOMM
2006
ACM
13 years 11 months ago
2006
ACM
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
SAINT
2008
IEEE
13 years 11 months ago
2008
IEEE
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
MOBILITY
2009
ACM
13 years 11 months ago
2009
ACM
We present the feasibility evaluation of a structured communication-oriented Peer-to-Peer (P2P) system being used in mobile environments in this paper. The different levels of chu...
SIGCOMM
2005
ACM
13 years 10 months ago
2005
ACM
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
IPTPS
2003
Springer
13 years 10 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...