On Scheduling and Redundancy for P2P Backup

Details On Scheduling and Redundancy for P2P Backup On Scheduling and Redundancy for P2P Backup

2010-09-07

arxiv.org/abs/1009.1344v1

Computer Science

Networking and Internet Architecture

Scientific paper

An online backup system should be quick and reliable in both saving and restoring users' data. To do so in a peer-to-peer implementation, data transfer scheduling and the amount of redundancy must be chosen wisely. We formalize the problem of exchanging multiple pieces of data with intermittently available peers, and we show that random scheduling completes transfers nearly optimally in terms of duration as long as the system is sufficiently large. Moreover, we propose an adaptive redundancy scheme that improves performance and decreases resource usage while keeping the risks of data loss low. Extensive simulations show that our techniques are effective in a realistic trace-driven scenario with heterogeneous bandwidth.

Affiliated with

Also associated with

No associations

Rating

On Scheduling and Redundancy 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 On Scheduling and Redundancy for P2P Backup, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Scheduling and Redundancy for P2P Backup will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704917