A survey of DHT security techniques
Peer-to-peer networks based on distributed hash tables (DHTs) have received considerable
attention ever since their introduction in 2001. Unfortunately, DHT-based systems have been …
attention ever since their introduction in 2001. Unfortunately, DHT-based systems have been …
Network coding for distributed storage systems
AG Dimakis, PB Godfrey, Y Wu… - IEEE transactions on …, 2010 - ieeexplore.ieee.org
Distributed storage systems provide reliable access to data through redundancy spread over
individually unreliable nodes. Application scenarios include data centers, peer-to-peer …
individually unreliable nodes. Application scenarios include data centers, peer-to-peer …
[PDF][PDF] Families of models that cross levels of resolution: Issues for design, calibration and management
PK Davis, R Hillestad - Proceedings of the 25th conference on Winter …, 1993 - dl.acm.org
This review paper summarizes an ARPA-sponsored project to study variable-resolution
modeling (VRM) and the connection of models across levels of resolution. We describe work …
modeling (VRM) and the connection of models across levels of resolution. We describe work …
Wikipedia workload analysis for decentralized hosting
G Urdaneta, G Pierre, M Van Steen - Computer Networks, 2009 - Elsevier
We study an access trace containing a sample of Wikipedia's traffic over a 107-day period
aiming to identify appropriate replication and distribution strategies in a fully decentralized …
aiming to identify appropriate replication and distribution strategies in a fully decentralized …
Total Recall: System Support for Automated Availability Management.
Availability is a storage system property that is both highly desired and yet minimally
engineered. While many systems provide mechanisms to improve availability-such as …
engineered. While many systems provide mechanisms to improve availability-such as …
High availability in DHTs: Erasure coding vs. replication
R Rodrigues, B Liskov - International Workshop on Peer-to-Peer Systems, 2005 - Springer
High availability in peer-to-peer DHTs requires data redundancy. This paper compares two
popular redundancy schemes: replication and erasure coding. Unlike previous …
popular redundancy schemes: replication and erasure coding. Unlike previous …
Free riding on Gnutella revisited: the bell tolls?
A new analysis of free riding on the Gnutella network updates data from 2000 and points to
an increasing downgrade in the network's overall performance and the emergence of a" …
an increasing downgrade in the network's overall performance and the emergence of a" …
[HTML][HTML] Survey of research towards robust peer-to-peer networks: Search methods
J Risson, T Moors - 2007 - rfc-editor.org
RFC 4981: Survey of Research towards Robust Peer-to-Peer Networks: Search Methods [RFC
Home] [TEXT|PDF|HTML] [Tracker] [IPR] [Info page] INFORMATIONAL Network Working Group …
Home] [TEXT|PDF|HTML] [Tracker] [IPR] [Info page] INFORMATIONAL Network Working Group …
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 solutions …
latency network storage is a challenge. Existing systems have explored a range of solutions …
[PDF][PDF] Efficient Replica Maintenance for Distributed Storage Systems.
This paper considers replication strategies for storage systems that aggregate the disks of
many nodes spread over the Internet. Maintaining replication in such systems can be …
many nodes spread over the Internet. Maintaining replication in such systems can be …