Sciweavers

33 search results - page 1 / 7
» The Design and Evaluation of Techniques for Route Diversity ...
Sort
View
P2P
2007
IEEE
132views Communications» more  P2P 2007»
13 years 10 months ago
The Design and Evaluation of Techniques for Route Diversity 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
PODC
2003
ACM
13 years 9 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
13 years 9 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
ESORICS
2005
Springer
13 years 10 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...
TON
2010
138views more  TON 2010»
12 years 11 months ago
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
Fong Pong, Nian-Feng Tzeng