Sciweavers

346 search results - page 4 / 70
» Routing networks for distributed hash tables
Sort
View
P2P
2007
IEEE
153views Communications» more  P2P 2007»
14 years 1 days 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 ...
FCSC
2007
131views more  FCSC 2007»
13 years 5 months ago
SONNET: subscription using path queries over structured overlay networks
Application-level content-based routing using XML is a key technology for decentralized publish/subscribe systems. In this paper, a new approach is proposed to support the efficien...
Weining Qian, Linhao Xu, Aoying Zhou, Minqi Zhou
ESORICS
2005
Springer
13 years 11 months ago
Sybil-Resistant DHT Routing
Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in ...
George Danezis, Chris Lesniewski-Laas, M. Frans Ka...
P2P
2006
IEEE
130views Communications» more  P2P 2006»
13 years 11 months ago
The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Cyrus Harvesf, Douglas M. Blough