Proactive Repairs and Incentives for Content Availability in P2P Overlay Networks

Summary Peer-to-Peer (P2P) networks enable access to shared distributed resources across the Internet. However, the availability of these resources is hindered by the members' transient participation (i.e., churn) and uncooperative behaviors (e.g., free-riding). Content redundancy using the idle storage space of nodes can be used to improve content availability. Maintain the scalability and self-organization properties of a P2P system, however, requires (i) minimizing the redundancy repair traffic (caused by churn), (ii) self-organizing mechanisms to balance the load and (iii) mechanisms to promote cooperation and enforce fair exchange of resources. In this paper, we take a holistic approach to content availability and propose a framework centered on efficient content redundancy, low- overhead maintenance and repair and incentives to mitigate the impact of churn. To this end, we propose a redundancy scheme that requires reduced repair bandwidth to improve content availability. The scheme is augmented with an efficient redundancy maintenance process to automate repairs. We also introduce a novel incentive- based mechanism to ensure a sustained and fair participation of peers and fair content sharing. The proposed redundancy scheme, referred to as Proactive Repair (PR), is studied analytically. The analysis shows that its repair bandwidth outperforms that of erasure coding and exact-MBR network coding. The proposed algorithms and mechanisms are implemented in an experimental testbed to evaluate their performance. The results indicate that our proposed solution is feasible and that it can improve content availability in P2P networks significantly.

[1]  Ira Pramanick,et al.  High Availability , 2001, Int. J. High Perform. Comput. Appl..

[2]  D. M. Chiu,et al.  Erasure code replication revisited , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

[3]  Eduardo Pinheiro,et al.  Failure Trends in a Large Disk Drive Population , 2007, FAST.

[4]  John Kubiatowicz,et al.  Erasure Coding Vs. Replication: A Quantitative Comparison , 2002, IPTPS.

[5]  Dmitri Loguinov,et al.  Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[6]  Guihai Chen,et al.  Redundancy Schemes for High Availability in DHTs , 2005, ISPA.

[7]  Rodrigo Rodrigues,et al.  High Availability in DHTs: Erasure Coding vs. Replication , 2005, IPTPS.

[8]  Zaigham Mahmood,et al.  A Review of Incentive Mechanisms in Peer-to-Peer Systems , 2009 .

[9]  Yunnan Wu,et al.  A Survey on Network Codes for Distributed Storage , 2010, Proceedings of the IEEE.

[10]  David Moore,et al.  Replication Strategies for Highly Available Peer-to-Peer Storage , 2002, Future Directions in Distributed Computing.

[11]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

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

[13]  Bin Li,et al.  Content Availability and Bundling in Swarming Systems , 2013, IEEE/ACM Trans. Netw..

[14]  Rodrigo Rodrigues,et al.  Proceedings of Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two , 2022 .

[15]  Yunnan Wu,et al.  Network coding for distributed storage systems , 2010, IEEE Trans. Inf. Theory.

[16]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[17]  Nihar B. Shah,et al.  Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction , 2010, IEEE Transactions on Information Theory.

[18]  Ladislau Bölöni,et al.  A macroeconomic model for resource allocation in large-scale distributed systems , 2008, J. Parallel Distributed Comput..

[19]  Panayotis Antoniadis,et al.  Incentives for content availability in memory-less peer-to-peer file sharing systems , 2005, SECO.