Cooperating with free riders in unstructured P2P networks

Free riding is a common phenomenon in peer-to-peer (P2P) file sharing networks. Although several mechanisms have been proposed to handle free riding-mostly to exclude free riders, few of them have been adopted in a practical system. This may be attributed to the fact that the mechanisms are often nontrivial, and that completely eliminating free riders could jeopardize the sheer power of the network arising from the huge volume of its participants. Rather than excluding free riders, we incorporate and utilize them to provide global index service to the files shared in the network, as well as to relay messages in the search process. The simulation results indicate that our mechanism not only can shift the query processing load from non-free riders to free riders, but can also significantly boost the search efficiency of a plain Gnutella. Moreover, the mechanism is quite resilient to high free riding ratio.

[1]  Yiwei Thomas Hou,et al.  Guest Editorial Recent Advances in Service Overlay Networks , 2004 .

[2]  Nick Antonopoulos,et al.  Towards a Cluster Based Incentive Mechanism for P2P Networks , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.

[3]  S. Jarvenpaa,et al.  Are Contributions to P2P Technical Forums Private or Public Goods? – An Empirical Investigation , 2003 .

[4]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

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

[6]  Ramesh Govindan,et al.  The Design of A Distributed Rating Scheme for Peer-to-peer Systems , 2007 .

[7]  Zizhuo Wang,et al.  A unified framework for dynamic pari-mutuel information market design , 2009, EC '09.

[8]  Hector Garcia-Molina,et al.  Incentives for Combatting Freeriding on P2P Networks , 2003, Euro-Par.

[9]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[10]  Li Xiao,et al.  Building a Scalable Bipartite P2P Overlay Network , 2007, IEEE Trans. Parallel Distributed Syst..

[11]  Jacky C. Chu,et al.  Availability and locality measurements of peer-to-peer file systems , 2002, SPIE ITCom.

[12]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[13]  Hector Garcia-Molina,et al.  Non-Cooperation in Competitive P2P Networks , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[14]  Divyakant Agrawal,et al.  A game theoretic framework for incentives in P2P systems , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[15]  Özgür Ulusoy,et al.  Counteracting free riding in Peer-to-Peer networks , 2008, Comput. Networks.

[16]  Donald F. Towsley,et al.  Incentives to promote availability in peer-to-peer anonymity systems , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[17]  H. Varian,et al.  On the private provision of public goods , 1986 .

[18]  D. Hales.  From selfish nodes to cooperative networks - emergent link-based incentives in peer-to-peer networks , 2004 .

[19]  Panayotis Antoniadis,et al.  Enforcing efficient resource provisioning in peer-to-peer file sharing systems , 2006, OPSR.

[20]  Lakshmish Ramaswamy,et al.  Free riding: a new challenge to peer-to-peer file sharing systems , 2003, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[21]  Akbar Ghaffarpour Rahbar,et al.  PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing , 2007, IEEE Transactions on Parallel and Distributed Systems.

[22]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[23]  Kostas G. Anagnostakis,et al.  Exchange-based incentive mechanisms for peer-to-peer file sharing , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[24]  Hui Zhang,et al.  A case for taxation in peer-to-peer streaming broadcast , 2004, PINS '04.

[25]  Konstantinos Psounis,et al.  A Peer-to-Peer Cooperation Enhancement Scheme and its Performance Analysis , 2006, J. Commun..

[26]  Ramayya Krishnan,et al.  The Virtual Commons: Why Free-Riding Can Be Tolerated in File Sharing Networks , 2002, ICIS.

[27]  Dan S. Wallach,et al.  A Survey of Peer-to-Peer Security Issues , 2002, ISSS.

[28]  G. Hardin.  The Tragedy of the Commons , 2009 .

[29]  Akinori Yonezawa,et al.  Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems , 2002 .

[30]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[31]  Yuh-Jzer Joung,et al.  Probabilistic file indexing and searching in unstructured peer-to-peer networks , 2006, Comput. Networks.

[32]  Klemens Böhm,et al.  Incentives engineering for structured P2P systems - a feasibility demonstration using economic experiments , 2006, EC '06.

[33]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[34]  Yunhao Liu.  A Two-Hop Solution to Solving Topology Mismatch , 2008, IEEE Transactions on Parallel and Distributed Systems.

[35]  Corporate,et al.  The handbook of information security , 1991 .

[36]  Scott Shenker,et al.  Hidden-action in multi-hop routing , 2005, EC '05.

[37]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[38]  Yuh-Jzer Joung,et al.  Capitalizing on Free Riders in P2P Networks , 2007, Euro-Par.

[39]  George Varghese,et al.  Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications , 2001, SIGCOMM 2001.

[40]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[41]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[42]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[43]  George D. Stamoulis,et al.  Reputation-based policies that provide the right incentives in peer-to-peer environments , 2006, Comput. Networks.

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

[45]  Christos H. Papadimitriou,et al.  Free-riding and whitewashing in peer-to-peer systems , 2006, IEEE J. Sel. Areas Commun..

[46]  Jeffrey K. MacKie-Mason,et al.  Why share in peer-to-peer networks? , 2008, ICEC.

[47]  Bin Yu,et al.  An incentive mechanism for message relaying in unstructured peer-to-peer systems , 2009, Electron. Commer. Res. Appl..

[48]  Geoff Coulson,et al.  Free Riding on Gnutella Revisited: The Bell Tolls? , 2005, IEEE Distributed Syst. Online.

[49]  Kevin Leyton-Brown,et al.  Incentives for sharing in peer-to-peer networks , 2001, EC '01.

[50]  Emin Gün Sirer,et al.  KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing , 2003 .

[51]  Yuh-Jzer Joung,et al.  Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity , 2007, Comput. Networks.