An empirical study of availability in friend-to-friend storage systems

作者:Sharma Rajesh*; Datta Anwitaman; Dell'Amico Matteo; Michiardi Pietro
来源:11th IEEE International Conference on Peer-to-Peer Computing (P2P), 2011-08-31 to 2011-09-02.

摘要

Friend-to-friend networks, i.e. peer-to-peer networks where data are exchanged and stored solely through nodes owned by trusted users, can guarantee dependability, privacy and uncensorability by exploiting social trust. However, the limitation of storing data only on friends can come to the detriment of data availability: if no friends are online, then data stored in the system will not be accessible. In this work, we explore the trade-offs between redundancy (i.e., how many copies of data are stored on friends), data placement (the choice of which friend nodes to store data on) and data availability (the probability of finding data online). We show that the problem of obtaining maximal availability while minimizing redundancy is NP-complete; in addition, we perform an exploratory study on data placement strategies, and we investigate their performance in terms of redundancy needed and availability obtained. By performing a trace-based evaluation, we show that nodes with as few as 10 friends can already obtain good availability levels.

  • 出版日期2011
  • 单位南阳理工学院