Sciweavers

343 search results - page 62 / 69
» Weighted distributed hash tables
Sort
View
IMC
2006
ACM
14 years 1 months ago
Understanding churn in peer-to-peer networks
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...
Daniel Stutzbach, Reza Rejaie
CIKM
2005
Springer
14 years 28 days ago
Internet scale string attribute publish/subscribe data networks
With this work we aim to make a three-fold contribution. We first address the issue of supporting efficiently queries over string-attributes involving prefix, suffix, containmen...
Ioannis Aekaterinidis, Peter Triantafillou
IPTPS
2005
Springer
14 years 27 days ago
Arpeggio: Metadata Searching and Content Sharing with Chord
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
Austin T. Clements, Dan R. K. Ports, David R. Karg...
SPAA
2003
ACM
14 years 19 days ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
ICDCS
2010
IEEE
13 years 11 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...