Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Latency-Driven Replica Placement
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Taming aggressive replication in the Pangaea wide-area file system
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Ivy: a read/write peer-to-peer file system
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Awarded Best Student Paper! - Pond: The OceanStore Prototype
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
A Latency-Based Object Placement Approach in Content Distribution Networks
LA-WEB '05 Proceedings of the Third Latin American Web Congress
POTSHARDS: secure long-term storage without encryption
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Distributed and Parallel Databases
| Hi-index | 0.00 |
Wide area distributed storage systems leverage the scale of the Internet to provide vast amounts of data storage capabilities. The typical building block is a peer-to-peer system that can pool disparate distributed resources into a cohesive storage system. However, the participant nodes are relatively unreliable and thus, distributed storage systems must take care to provide replicas of data objects. A common problem is how to allocate objects to nodes in the system and previous work has allocated objects based on popularity. However, these schemes are not general enough to minimize latency or deal with redundancy schemes such as erasure codes which are based on replication of object fragments. In this paper, we present a strategy for placement of replica fragments particularly with respect to the minimization of data communication latencies.