Small Coalitions: Lightweight Collaboration for Efficient P2P Downloads

Peer-to-peer (P2P) architectures are gaining increasing popularity in disseminating content to a large number of nodes. In this paper, we show that small coalitions between peers can further enhance the performance of current P2P architectures. Small coalitions bridge the gap between inefficient non-cooperative and fully cooperative architectures by establishing a robust tradeoff between the complexity and performance of the resource distribution process. Owing to their small size, small coalitions are inherently resilient to the churn in existing P2P systems and embed natural incentives for peers to self-organize in order to improve their download times. We evaluate several coalition strategies analytically and empirically via simulations and we show that our solutions considerably improve the download performance in current P2P systems.

[1]  Guillaume Urvoy-Keller,et al.  Rarest first and choke algorithms are enough , 2006, IMC '06.

[2]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

[3]  Dhabaleswar K. Panda,et al.  Efficient collective communication on heterogeneous networks of workstations , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[4]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[5]  Samir Khuller,et al.  On broadcasting in heterogenous networks , 2004, SODA '04.

[6]  Krishna P. Gummadi,et al.  A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems , 2002, CCRV.

[7]  Alexandru Iosup,et al.  2Fast : Collaborative Downloads in P2P Networks , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[8]  Gustavo de Veciana,et al.  Performance of peer-to-peer networks: Service capacity and role of resource sharing policies , 2006, Perform. Evaluation.

[9]  Ghassan O. Karame,et al.  A Secure Hybrid Reputation Management System for Super-Peer Networks , 2008, 2008 5th IEEE Consumer Communications and Networking Conference.

[10]  Xiaowei Yang,et al.  Robust and Efficient Incentives for Cooperative Content Distribution , 2009, IEEE/ACM Transactions on Networking.

[11]  Yao-Nan Lien,et al.  Performance issues of P2P file sharing over asymmetric and wireless networks , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

[12]  Pablo Rodriguez,et al.  Overlay architectures for file distribution: Fundamental performance analysis for homogeneous and heterogeneous cases , 2007, Comput. Networks.

[13]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[14]  Vishal Misra,et al.  Improving BitTorrent: a simple approach , 2008, IPTPS.

[15]  Gustavo de Veciana,et al.  Service capacity of peer to peer networks , 2004, IEEE INFOCOM 2004.

[16]  Arun Venkataramani,et al.  Do incentives build robustness in bit torrent , 2007 .

[17]  Michael Sirivianos,et al.  Dandelion: Cooperative Content Distribution with Robust Incentives , 2007, USENIX Annual Technical Conference.

[18]  Samir Khuller,et al.  Broadcasting in Heterogeneous Networks , 2007, Algorithmica.

[19]  Pascal Felber,et al.  Self-organization in Cooperative Content Distribution Networks , 2005, Fourth IEEE International Symposium on Network Computing and Applications.