Abstract
We evaluate the performance of erasure codes for different models in P2P storage systems. The comparative analysis is based on that node session length follows exponential distribution (ED), Pareto distribution (PD), and Weibull distribution (WD). The reliability theory is utilized to evaluate the mean data availability. More, we evaluate the impact of both node-join churn and erasure coding parameters m, n on data duration. And we compare the effective results of different churn models by simulations. The simulations are driven by both real and synthetic traces. The results show that node-join churn causes no impact on data duration if node session length follows ED, but different impact on duration if node session length follows PD and WD. The impacts on duration for both WD and PD increase with the raising node-join churn degree. In the cases of the fixed redundancy rate, the increase of m and n reduces the data duration.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
