Sciweavers

17 search results - page 1 / 4
» Replication Strategies for Reliable Decentralised Storage
Sort
View
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
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
JCP
2006
93views more  JCP 2006»
13 years 4 months ago
Reliable Partial Replication of Contents in Web Clusters: Getting Storage without losing Reliability
Traditionally, distributed Web servers have used two strategies for allocating files on server nodes: full replication and full distribution. While full replication provides a high...
José Daniel García, Jesús Car...
AC
2003
Springer
13 years 9 months ago
Replication Strategies for Highly Available Peer-to-Peer Storage
We are investigating strategies for using replication to design and implement highly reliable peer-to-peer systems. In particular, we are comparing the use of whole object and blo...
Ranjita Bhagwan, David Moore, Stefan Savage, Geoff...
ICPP
2007
IEEE
13 years 10 months ago
Achieving Reliability through Replication in a Wide-Area Network DHT Storage System
It is a challenge to design and implement a wide-area distributed hash table (DHT) which provides a storage service with high reliability. Many existing systems use replication to...
Jing Zhao, Hongliang Yu, Kun Zhang, Weimin Zheng, ...