Redundancy Management for P2P Backup

Details Redundancy Management for P2P Backup Redundancy Management for P2P Backup

2012-01-11

arxiv.org/abs/1201.2360v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We design and analyze the performance of a redundancy management mechanism for Peer-to-Peer backup applications. Armed with the realization that a backup system has peculiar requirements -- namely, data is read over the network only during restore processes caused by data loss -- redundancy management targets data durability rather than attempting to make each piece of information availabile at any time. In our approach each peer determines, in an on-line manner, an amount of redundancy sufficient to counter the effects of peer deaths, while preserving acceptable data restore times. Our experiments, based on trace-driven simulations, indicate that our mechanism can reduce the redundancy by a factor between two and three with respect to redundancy policies aiming for data availability. These results imply an according increase in storage capacity and decrease in time to complete backups, at the expense of longer times required to restore data. We believe this is a very reasonable price to pay, given the nature of the application. We complete our work with a discussion on practical issues, and their solutions, related to which encoding technique is more suitable to support our scheme.

Affiliated with

Also associated with

No associations

Rating

Redundancy Management for P2P Backup does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Redundancy Management for P2P Backup, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Redundancy Management for P2P Backup will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-604566