Sciweavers

343 search results - page 40 / 69
» Weighted distributed hash tables
Sort
View
SERSCISA
2009
Springer
14 years 5 months ago
A Kademlia-Based Node Lookup System for Anonymization Networks
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...
Benedikt Westermann, Andriy Panchenko, Lexi Pimeni...
SAINT
2008
IEEE
14 years 5 months ago
Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
Richard Price, Tien Tuan Anh Dinh, Georgios K. The...
P2P
2006
IEEE
148views Communications» more  P2P 2006»
14 years 5 months ago
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave e...
Thomas Locher, Stefan Schmid, Roger Wattenhofer
IPTPS
2004
Springer
14 years 4 months ago
On the Cost of Participating in a Peer-to-Peer Network
In this paper, we model the cost incurred by each peer participating in a peer-to-peer network. Such a cost model allows to gauge potential disincentives for peers to collaborate,...
Nicolas Christin, John Chuang
IPTPS
2003
Springer
14 years 4 months ago
Structured Peer-to-Peer Overlays Need Application-Driven Benchmarks
Considerable research effort has recently been devoted to the design of structured peer-to-peer overlays, a term we use to encompass Content-Addressable Networks (CANs), Distribut...
Sean C. Rhea, Timothy Roscoe, John Kubiatowicz