Performance Analysis of Peer-to-Peer Storage Systems

Alouf, Sara; Dandoush, Abdulhalim; Nain, Philippe

doi:10.1007/978-3-540-72990-7_57

Cited by 15 publications

(24 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is worth mentioning that the simulation analysis of [7] has concluded that the recovery time follows roughly a hypo-exponential distribution. As a consequence, the models presented in this paper are more realistic than those in [3,6]. We conclude this section by a word on the notation: a subscript "c" (resp.…”

Section: Assumptionmentioning

confidence: 96%

“…In our previous work [6], simplifying assumptions have been considered while modeling the P2PSS, mainly that the recovery process is exponentially distributed. However, the implications of this assumption differ between replicated and erasure-coded systems.…”

Section: Related Work and Backgroundmentioning

confidence: 99%

“…Indeed, each of these durations is the summation of independently distributed exponential rvs (s + k in the centralized scheme if k fragments are to be reconstructed, and s in the distributed scheme) having each its own rate. This is a fundamental difference with [3,6] where the recovery process is assumed to follow an exponential distribution. It is worth mentioning that the simulation analysis of [7] has concluded that the recovery time follows roughly a hypo-exponential distribution.…”

Section: Assumptionmentioning

confidence: 99%

See 2 more Smart Citations

Performance Analysis of Centralized versus Distributed Recovery Schemes in P2P Storage Systems

Dandoush

Alouf

Nain

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. This paper studies the performance of Peer-to-Peer Storage Systems (P2PSS) in terms of data lifetime and availability. Two schemes for recovering lost data are modeled through absorbing Markov chains and their performance are evaluated and compared. The first scheme relies on a centralized controller that can recover multiple losses at once, whereas the second scheme is distributed and recovers one loss at a time. The impact of each system parameter on the performance is evaluated, and guidelines are derived on how to engineer the system and tune its key parameters in order to provide desired lifetime and/or availability of data. We find that, in stable environments such as local area or research laboratory networks where machines are usually highly available, the distributed-repair scheme offers a reliable, scalable and cheap storage/backup solution. This is in contrast with the case of highly dynamic environments, where the distributed-repair scheme is inefficient as long as the storage overhead is kept reasonable. P2PSS with centralized-repair scheme are efficient in any environment but have the disadvantage of relying on a centralized authority. Our analysis also suggests that the use of large size fragments reduces the efficiency of the recovery mechanism.

show abstract

Section: Assumptionmentioning

confidence: 96%

Section: Related Work and Backgroundmentioning

confidence: 99%

Section: Assumptionmentioning

confidence: 99%

See 1 more Smart Citation

Performance Analysis of Centralized versus Distributed Recovery Schemes in P2P Storage Systems

Dandoush

Alouf

Nain

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

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%

“…We model the behavior of a block b in a lazy RS system by a CTMC, depicted in Figure 2(a). We did not use the chains classically used in the literature [2,7]. Our chain models the possible loss of the reconstructor p(b) during a reconstruction.…”

Section: Markov Chain Modelsmentioning

confidence: 99%

Hybrid Approaches for Distributed Storage Systems

Araújo

Giroire

Monteiro

2011

Lecture Notes in Computer Science

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

Data Management in Cloud, Grid and P2P Systems

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Performance Analysis of Peer-to-Peer Storage Systems

Cited by 15 publications

References 10 publications

Performance Analysis of Centralized versus Distributed Recovery Schemes in P2P Storage Systems

Performance Analysis of Centralized versus Distributed Recovery Schemes in P2P Storage Systems

Hybrid Approaches for Distributed Storage Systems

Data Management in Cloud, Grid and P2P Systems

Contact Info

Product

Resources

About