Sciweavers

79 search results - page 1 / 16
» Comparing the Performance of Distributed Hash Tables Under C...
Sort
View
IPTPS
2004
Springer
13 years 10 months ago
Comparing the Performance of Distributed Hash Tables Under Churn
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Rober...
INFOCOM
2005
IEEE
13 years 10 months ago
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Fr...
GLOBECOM
2010
IEEE
13 years 2 months ago
Analysis of Messaging Load in a P2PP Overlay Network under Churn
We analyze the performance of a DHT-based P2P overlay network in resource access and overlay maintenance activities. We use a cross-platform implementation of the protocol called P...
Otso Kassinen, Erkki Harjula, Mika Ylianttila
PERCOM
2006
ACM
14 years 4 months ago
Performance Analysis of Stealth DHT with Mobile Nodes
The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes co...
Andrew MacQuire, Andrew Brampton, Idris A. Rai, La...
P2P
2007
IEEE
153views Communications» more  P2P 2007»
13 years 11 months ago
On Routing in Distributed Hash Tables
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 ...
Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le ...