Sciweavers

33 search results - page 2 / 7
» The Design and Evaluation of Techniques for Route Diversity ...
Sort
View
IEEEARES
2006
IEEE
13 years 10 months ago
Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
Matthew Leslie, Jim Davies, Todd Huffman
JNW
2006
145views more  JNW 2006»
13 years 4 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman
SIGCOMM
2006
ACM
13 years 10 months ago
Virtual ring routing: network routing inspired by DHTs
This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in D...
Matthew Caesar, Miguel Castro, Edmund B. Nightinga...
IPPS
2007
IEEE
13 years 11 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
CNSR
2005
IEEE
100views Communications» more  CNSR 2005»
13 years 6 months ago
Malicious Behaviour in Content-Addressable Peer-to-Peer Networks
Distributed Hash Tables (DHTs) promise to manage huge sets of key-value pairs in a Peer-to-Peer manner. The Content-Addressable Network (CAN) is a prominent variant of DHT. A crit...
Thomas Reidemeister, Klemens Böhm, Paul A. S....