Performance comparison of erasure codes for different churn models in P2P storage systems

Authors:
Jinxing Li;Guangping Xu;Hua Zhang
Affiliations:
Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, China;Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, China;Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, China
Venue:
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Year:
2010

Citing 9
Cited 1

Analysis of the evolution of peer-to-peer systems

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Erasure Code Replication Revisited

P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Understanding churn in peer-to-peer networks

Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Handling churn in a DHT

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
A global view of kad

Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Churn Impact on Replicated Data Duration in Structured P2P Networks

WAIM '08 Proceedings of the 2008 The Ninth International Conference on Web-Age Information Management
Modeling machine availability in enterprise and wide-area distributed computing environments

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
High availability in DHTs: erasure coding vs. replication

IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems

Towards efficient replication of documents in chord: case (r,s) erasure codes

ICICA'12 Proceedings of the Third international conference on Information Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

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.