text: 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.
  @cite_1: 
  @cite_11: Peer-to-peer backup systems provide mechanisms that allow participants to store their data cooperatively. When the proportion of unstable peers grows, these systems need to increase redundancy to maintain data availability. This redundancy could be reduced by storing data to more stable peers. In consequence, network traffic would be reduced and the global network?s storage capacity would be increased. In this work we present a novel distributed backup system that improves data availability and network fairness. Using only local information our system creates groups of peers with similar stabilities. These groups are used to choose partners and to exchange data symmetrically with them. With this technique we guarantee that all peers obtain a data availability proportional to their stability and that all peers receive the same backup capacity than the disk space that they share.
  @cite_4: Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent experience shows, the anonymous, open nature of these networks offers an almost ideal environment for the spread of self-replicating inauthentic files.We describe an algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that assigns each peer a unique global trust value, based on the peer's history of uploads. We present a distributed and secure method to compute global trust values, based on Power iteration. By having peers use these global trust values to choose the peers from whom they download, the network effectively identifies malicious peers and isolates them from the network.In simulations, this reputation system, called EigenTrust, has been shown to significantly decrease the number of inauthentic files on the network, even under a variety of conditions where malicious peers cooperate in an attempt to deliberately subvert the system.
  @cite_8: Peer-to-peer systems are typically designed around the assumption that all peers will willingly contribute resources to a global pool. They thus suffer from freeloaders, that is, participants who consume many more resources than they contribute. In this paper, we propose a general economic framework for avoiding freeloaders in peer-to-peer systems. Our system works by keeping track of the resource consumption and resource contribution of each participant. The overall standing of each participant in the system is represented by a single scalar value, called their karma. A set of nodes, called a bankset, keeps track of each node’s karma, increasing it as resources are contributed, and decreasing it as they are consumed. Our framework is resistant to malicious attempts by the resource provider, consumer, and a fraction of the members of the bank set. We illustrate the application of this framework to a peer-to-peer filesharing
summary: A recurrent problem for P2P applications is creating incentives to encourage nodes in contributing more resources. This can be done via reputation systems @cite_4 or virtual currency @cite_8 . Specifically for storage systems, an easy and efficient solution is segregating nodes in sub-networks with roughly homogeneous characteristics such as uptime and storage space @cite_11 @cite_1 .