Data reliability of distributed brick storage systems critically depends on the replica placement policy, and the two governing forces are repair speed and sensitivity to multiple concurrent failures. In this paper, we provide an analytical framework to reason and quantify the impact of replica placement policy to system reliability. The novelty of the framework is its consideration of the bounded network bandwidth for data maintenance. We apply the framework to two popular schemes, namely sequential placement and random placement, and show that both have drawbacks that significantly degrade data reliability. We then propose the stripe placement scheme and find the near-optimal configuration parameter such that it provides much better relia...
Replicating data objects has been suggested as a means of increasing the performance of a distribute...
International audienceDistributed storage systems such as Hadoop File System or Google File System ...
Abstract — Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in ...
The placement of replicas across storage nodes in a replication-based storage system is known to aff...
Replication is a widely used method to protect large- scale data storage systems from data loss when...
This paper considers replication strategies for storage systems that aggregate the disks of many nod...
International audienceDistributed storage systems such as Hadoop File System or Google File System (...
Reliability is a critical metric in the design and development of scale-out data storage clusters. A...
This paper explores the feasibility of a cost-efficient storage architecture that offers the reliabi...
International audienceDistributed storage systems rely heavily on redundancy to ensure data availabi...
Abstract: Kinesis is a novel data placement model for dis-tributed storage systems. It exemplifies t...
In this paper we examine the effects of replication on the availability of data in a large network. ...
International audienceDistributed storage systems have to ensure data availability and durability de...
As the disks typically found in personal computers grow larger, protecting data by replicating it on...
Distributed hash tables (DHTs) can be used as the ba-sis of a resilient lookup service in unstable e...
Replicating data objects has been suggested as a means of increasing the performance of a distribute...
International audienceDistributed storage systems such as Hadoop File System or Google File System ...
Abstract — Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in ...
The placement of replicas across storage nodes in a replication-based storage system is known to aff...
Replication is a widely used method to protect large- scale data storage systems from data loss when...
This paper considers replication strategies for storage systems that aggregate the disks of many nod...
International audienceDistributed storage systems such as Hadoop File System or Google File System (...
Reliability is a critical metric in the design and development of scale-out data storage clusters. A...
This paper explores the feasibility of a cost-efficient storage architecture that offers the reliabi...
International audienceDistributed storage systems rely heavily on redundancy to ensure data availabi...
Abstract: Kinesis is a novel data placement model for dis-tributed storage systems. It exemplifies t...
In this paper we examine the effects of replication on the availability of data in a large network. ...
International audienceDistributed storage systems have to ensure data availability and durability de...
As the disks typically found in personal computers grow larger, protecting data by replicating it on...
Distributed hash tables (DHTs) can be used as the ba-sis of a resilient lookup service in unstable e...
Replicating data objects has been suggested as a means of increasing the performance of a distribute...
International audienceDistributed storage systems such as Hadoop File System or Google File System ...
Abstract — Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in ...