Analysis of failure correlation impact on peer-to-peer storage systems

Dalle, Olivier; Giroire, Frédéric; Monteiro, J; Pérennès, Stéphane

doi:10.1109/p2p.2009.5284518

Cited by 15 publications

(20 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The analytical answer to this question is not obvious even for a single stored object, but eventually, studying a single object is not adequate, since realistic environments require the storage of multiple objects, leading to further complexity [6].…”

Section: Premisesmentioning

confidence: 99%

A study of the performance of novel storage-centric repairable codes

2015

View full text Add to dashboard Cite

Erasure coding has become an integral part of the storage infrastructure in data-centers and cloud backends-since it provides significantly higher fault tolerance for substantially lower storage overhead compared to a naive approach like n-way replication. Fault tolerance refers to the ability to achieve very high availability despite (temporary) failures, but for long term data durability, the redundancy provided by erasure coding needs to be replenished as storage nodes fail or are retired. Traditional erasure codes are not easily amenable to repairs, and their repair process is usually both expensive and slow. Consequently, in recent years, numerous novel codes tailor-made for distributed storage have been proposed to optimize the repair process. Broadly, most of these codes belong to either of the two following families: network coding inspired regenerating codes that aim at minimizing the per repair traffic, and locally repairable codes (LRC) which minimize the number of nodes contacted per repair (which in turn leads to the reduction of repair traffic and latency). Existing studies of these codes however restrict themselves to the repair of individual data objects in isolation. They ignore many practical issues that a real system storing multiple objects needs to take into account. Our goal is to explore a subset of such issues, particularly pertaining to A. Datta et al. the scenario where multiple objects are stored in the system. We use a simulation based approach, which models the network bottlenecks at the edges of a distributed storage system, and the nodes' load and (un)availability. Specifically, we abstract the key features of both regenerating and LRC, and examine the effect of data placement and the corresponding de/correlation of failures, and the competition for limited network resources when multiple objects need to be repaired simultaneously by exploring the interplay of code parameters and trade-offs of bandwidth usage and speed of repairs.

show abstract

Section: Premisesmentioning

confidence: 99%

A study of the performance of novel storage-centric repairable codes

2015

View full text Add to dashboard Cite

show abstract

“…For this purpose, a monitoring process (possibly distributed) detects peer failures, decides when a redundancy level becomes critical and assigns recovery tasks to EPs. Several reconstruction policies exist to enable the recovery process; Dalle et al report some example in [3].…”

Section: The Simulation Modelmentioning

confidence: 99%

“…In [3], Dalle et al discuss about the failures impact on peer-to-peer storage systems. Here the authors propose some analytical models based on a fluid approximation, to assess the resource consumption and the probability of data losses when using erasure codes.…”

Section: Related Workmentioning

confidence: 99%

Integrated Tools for the Simulation Analysis of Peer-To-Peer Backup Systems

Dalle

Mancini

2012

Proceedings of the Fifth International Conference on Simulation Tools and Techniques

Self Cite

View full text Add to dashboard Cite

In order to evaluate the performance and estimate the resource usage of peer-to-peer backup systems, it is important to analyze the time they spend in storing, retrieving and keeping the redundancy of the stored files. The analysis of such systems is difficult due to the random behavior of the peers and the variations of network conditions. Simulations provide a unique means for reproducing such varying conditions in a controlled way. In this paper we describe a general meta-model for peer-to-peer backup systems and a tool-chain, based on SimGrid, to help in their analysis. We validated the meta-model and tool-chain through the analysis of a common scenario, and verified that they can be used, for example, for retrieving the relations between the storage size, the saved data fragment sizes and the induced network workload.

show abstract

“…P2P and large scale distributed storage systems have been analyzed by using Markov chains: for erasure codes in [2,7,6] and for replication in [14,5]. In this work, we model Hybrid Coding, Double Coding and Regenerating Codes with Markovian models.…”

Section: Related Workmentioning

confidence: 99%

Hybrid Approaches for Distributed Storage Systems

Araújo

Giroire

Monteiro

2011

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Distributed or peer-to-peer storage solutions rely on the introduction of redundant data to be fault-tolerant and to achieve high reliability. One way to introduce redundancy is by simple replication. This strategy allows an easy and fast access to data, and a good bandwidth efficiency to repair the missing redundancy when a peer leaves or fails in high churn systems. However, it is known that erasure codes, like Reed-Solomon, are an efficient solution in terms of storage space to obtain high durability when compared to replication. Recently, the Regenerating Codes were proposed as an improvement of erasure codes to better use the available bandwidth when reconstructing the missing information. In this work, we compare these codes with two hybrid approaches. The first was already proposed and mixes erasure codes and replication. The second one is a new proposal that we call Double Coding. We compare these approaches with the traditional Reed-Solomon code and also Regenerating Codes from the point of view of availability, durability and storage space. This comparison uses Markov Chain Models that take into account the reconstruction time of the systems.

show abstract

Analysis of failure correlation impact on peer-to-peer storage systems

Cited by 15 publications

References 20 publications

A study of the performance of novel storage-centric repairable codes

A study of the performance of novel storage-centric repairable codes

Integrated Tools for the Simulation Analysis of Peer-To-Peer Backup Systems

Hybrid Approaches for Distributed Storage Systems

Contact Info

Product

Resources

About