Hybrid client-server and peer-to-peer caching systems with selfish peers

This paper considers a hybrid peer-to-peer (p2p) system, a dynamic distributed caching system with an authoritative server dispensing contents only if the contents fail to be found by searching an unstructured peer-to-peer (p2p) system. We study the case when some peers may not be fully cooperative in the search process and examine the impact of various noncooperative behaviors on the querying load on the server as the peer population size increases. We categorize selfish peers into three classes: impatient peers that directly query the server without searching the p2p system, non-forwarders that refuse to forward query requests, and non-resolvers that refuse to share contents. It is shown that in the hybrid p2p system, impatient and/or nonforwarding behaviors prevent the system from scaling well because of the high server load, while the system scales well under the non-resolving selfish peers. Our study implies that the hybrid p2p system does not mandate an incentive mechanism for content sharing, which is in stark contrast to unstructured p2p systems, where incentivizing peers to share contents is known to be a key factor for the system's scalability.

[1]  Joel Friedman,et al.  A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

[2]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[3]  Levente Buttyán,et al.  Nash equilibria of packet forwarding strategies in wireless ad hoc networks , 2006, IEEE Transactions on Mobile Computing.

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

[5]  Matthew O. Jackson,et al.  How Homophily Affects Learning and Diffusion in Networks , 2008, 0811.4013.

[6]  Hector Garcia-Molina,et al.  Taxonomy of trust: Categorizing P2P reputation systems , 2006, Comput. Networks.

[7]  Stratis Ioannidis,et al.  On the design of hybrid peer-to-peer systems , 2008, SIGMETRICS '08.

[8]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[9]  Yung Yi,et al.  On the Payoff Mechanisms in Peer-Assisted Services With Multiple Content Providers: Rationality and Fairness , 2011, IEEE/ACM Transactions on Networking.

[10]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[11]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

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

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

[15]  Pablo Rodriguez,et al.  On next-generation telco-managed P2P TV architectures , 2008, IPTPS.

[16]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[17]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[18]  Christos Gkantsidis,et al.  Hybrid search schemes for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[19]  Stratis Ioannidis,et al.  Incentivizing peer-assisted services: a fluid shapley value approach , 2010, SIGMETRICS '10.

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

[21]  Prabhakar Raghavan.  Query Incentive Networks , 2005, ASIAN.

[22]  Ion Stoica,et al.  Robust incentive techniques for peer-to-peer networks , 2004, EC '04.

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

[24]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[25]  Rittwik Jana,et al.  Towards capacity and profit optimization of video-on-demand services in a peer-assisted IPTV platform , 2008, Multimedia Systems.