Sciweavers

447 search results - page 27 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
IPTPS
2005
Springer
15 years 5 months ago
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn
We present a dynamic distributed hash table where peers may join and leave at any time. Our system tolerates a powerful adversary which has complete visibility of the entire state ...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
IPTPS
2004
Springer
15 years 5 months ago
When Multi-hop Peer-to-Peer Lookup Matters
Distributed hash tables have been around for a long time [5, 7]. A number of recent projects propose peerto-peer DHTs, based on multi-hop lookup optimizations. Some of these syste...
Rodrigo Rodrigues, Charles Blake
PODC
2003
ACM
15 years 5 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
GCC
2005
Springer
15 years 5 months ago
Exploiting the Heterogeneity in Structured Peer-to-Peer Systems
The structured peer-to-peer system, which is based on the distributed hash table, offers an administration-free and fault-tolerant application-level overlay network. However, a ra...
Tongqing Qiu, Guihai Chen
PCI
2005
Springer
15 years 5 months ago
Storing and Locating Mutable Data in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Antony Chazapis, Nectarios Koziris