Sciweavers

45 search results - page 8 / 9
» Halo: High-Assurance Locate for Distributed Hash Tables
Sort
View
NSDI
2004
15 years 1 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
89
Voted
IPTPS
2005
Springer
15 years 5 months 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
2006
ACM
15 years 5 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
CCS
2010
ACM
14 years 12 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov
ICDCS
2010
IEEE
14 years 10 months ago
'Ethernet on AIR': Scalable Routing in very Large Ethernet-Based Networks
—Networks based on Ethernet bridging scale poorly as bridges flood the entire network repeatedly, and several schemes have been proposed to mitigate this flooding problem; howe...
Dhananjay Sampath, Suchit Agarwal, J. J. Garcia-Lu...