Uncoordinated Peer Selection in P2P Backup and Storage Applications

In this work we tackle the problem of on-line backup and storage with a peer-to-peer approach. We propose a novel system architecture involving the users' devices that confederate by pooling their resources and offer an alternative to capital-intensive data-centers. In contrast to current peer-to-peer architectures that build upon distributed hash-tables, we investigate whether an uncoordinated approach to data placement would prove effective in providing embedded incentives for users to offer local resources to the system. By modeling peers as selfish entities striving for minimizing their cost in participating to the system, we analyze equilibrium topologies that materialize from the process of peer selection, whereby peers establish bi-lateral links that involve storing data in a symmetric way. System stratification, colluding peers with similar contribution efforts, is an essential outcome of the peer selection process: peers are lured to improve the "quality" of local resources they provide to reach lower operational costs. Our results are corroborated by both a game-theoretic analysis and a numerical evaluation of several system configurations.

[1]  Pietro Michiardi,et al.  Analysis of user-driven peer selection in peer-to-peer backup and storage systems , 2008, Valuetools 2008.

[2]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[3]  Robert W. Irving,et al.  The stable fixtures problem - A many-to-many extension of stable roommates , 2007, Discret. Appl. Math..

[4]  Jacob R. Lorch,et al.  Farsite: federated, available, and reliable storage for an incompletely trusted environment , 2002, OSDI '02.

[5]  Stefan Savage,et al.  Total Recall: System Support for Automated Availability Management , 2004, NSDI.

[6]  Azer Bestavros,et al.  Implications of Selfish Neighbor Selection in Overlay Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[7]  Stefan Savage,et al.  Understanding Availability , 2003, IPTPS.

[8]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[9]  Panayotis Antoniadis,et al.  Comparing economic incentives in peer-to-peer networks , 2004, Comput. Networks.

[10]  David C. Parkes,et al.  The price of selfish behavior in bilateral network formation , 2005, PODC '05.

[11]  Roger Wattenhofer,et al.  Havelaar: A Robust and Efficient Reputation Systemfor Active Peer-to-Peer Systems , 2006 .

[12]  Roger Wattenhofer,et al.  Havelaar - Implementation Of A Peer-to-Peer Reputation System , 2006 .

[13]  Pietro Michiardi,et al.  A dynamic exchange game , 2008, PODC '08.

[14]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[15]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[16]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.