Performance analysis of file-splitting algorithm in peer-to-peer network backup systems

We propose a performance model for a peer-to-peer network backup systems. Our model provides a framework for evaluating backup time and file availability of the backup systems. In our study, files are splitting in three different modes: one chunk per node, fixed block size, and erasure code (Reed-Solomon and Luby Transform in particular). The results show that increasing the number of peers does not always increasing file availability. To get an optimal backup time (with best file availability), we discuss guidelines for parameter selections. Our models are validated by varying configurations and testing in a controlled environment.