Social Similarity Favors Cooperation: The Distributed Content Replication Case

This paper explores how the degree of similarity within a social group can dictate the behavior of the individual nodes, so as to best tradeoff the individual with the social benefit. More specifically, we investigate the impact of social similarity on the effectiveness of content placement and dissemination. We consider three schemes that represent well the spectrum of behavior-shaped content storage strategies: the selfish, the self-aware cooperative, and the optimally altruistic ones. Our study shows that when the social group is tight (high degree of similarity), the optimally altruistic behavior yields the best performance for both the entire group (by definition) and the individual nodes (contrary to typical expectations). When the group is made up of members with almost no similarity, altruism or cooperation cannot bring much benefit to either the group or the individuals and thus, selfish behavior emerges as the preferable choice due to its simplicity. Notably, from a theoretical point of view, our “similarity favors cooperation” argument is inline with sociological interpretations of human altruistic behavior. On a more practical note, the self-aware cooperative behavior could be adopted as an easy to implement distributed alternative to the optimally altruistic one; it has close to the optimal performance for tight social groups and the additional advantage of not allowing mistreatment of any node, i.e., its induced content retrieval cost is always smaller than the cost of the selfish strategy.

[1]  Roch Guérin,et al.  Quantifying content consistency improvements through opportunistic contacts , 2009, CHANTS '09.

[2]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[3]  R. Trivers The Evolution of Reciprocal Altruism , 1971, The Quarterly Review of Biology.

[4]  Sem C. Borst,et al.  Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[5]  Ioannis Stavrakakis,et al.  Joint interest- and locality-aware content dissemination in social networks , 2009, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services.

[6]  Yolanda Gil,et al.  Trusting Information Sources One Citizen at a Time , 2002, SEMWEB.

[7]  Ioannis Stavrakakis,et al.  ISCoDe: A framework for interest similarity-based community detection in social networks , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[8]  Refik Molva,et al.  Privacy in Content-Based Opportunistic Networks , 2009, 2009 International Conference on Advanced Information Networking and Applications Workshops.

[9]  Marco Conti,et al.  Design and performance evaluation of ContentPlace, a social-aware data dissemination system for opportunistic networks , 2010, Comput. Networks.

[10]  G. Marsaglia,et al.  Evaluating Kolmogorov's distribution , 2003 .

[11]  Krishna P. Gummadi,et al.  Measuring User Influence in Twitter: The Million Follower Fallacy , 2010, ICWSM.

[12]  T. Başar,et al.  Dynamic Noncooperative Game Theory, 2nd Edition , 1998 .

[13]  Dimitris Papadias,et al.  An overview of data replication on the Internet , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

[14]  Philip S. Yu,et al.  Replication Algorithms in a Remote Caching Architecture , 1993, IEEE Trans. Parallel Distributed Syst..

[15]  Nikolaos Laoutaris,et al.  Distributed Selfish Replication , 2006, IEEE Transactions on Parallel and Distributed Systems.

[16]  Sushil Jajodia,et al.  Distributed algorithms for dynamic replication of data , 1992, PODS.

[17]  Svante Janson,et al.  Measures of similarity between distributions , 1986 .

[18]  Stephen Hailes,et al.  A distributed trust model , 1998, NSPW '97.

[19]  Laura M. Zahn Why Birds of a Feather Flock Together , 2009, Science Signaling.

[20]  Wesley W. Chu,et al.  Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[21]  Valentino Pacifici,et al.  Selfish content replication on graphs , 2011, 2011 23rd International Teletraffic Congress (ITC).

[22]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[23]  Jerome L. Myers,et al.  Research Design and Statistical Analysis , 1991 .

[24]  John Scott Social Network Analysis , 1988 .

[25]  Michel Denuit,et al.  On the stop-loss and total variation distances between random sums , 2001 .

[26]  Mohamed Hefeeda,et al.  Traffic Modeling and Proportional Partial Caching for Peer-to-Peer Systems , 2008, IEEE/ACM Transactions on Networking.

[27]  Renato De Mori,et al.  Spoken Dialogues with Computers , 1998 .

[28]  L. Cosmides,et al.  Neurocognitive Adaptations Designed for Social Exchange. , 2015 .

[29]  Martin A. Nowak,et al.  Evolution of cooperation by phenotypic similarity , 2008, Proceedings of the National Academy of Sciences.

[30]  Iacopo Carreras,et al.  Social Opportunistic Computing: Design for Autonomic User-Centric Systems , 2010, Autonomic Communication.

[31]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[32]  Evgueni A. Haroutunian,et al.  Information Theory and Statistics , 2011, International Encyclopedia of Statistical Science.