Social similarity favors cooperation: the distributed content replication case

E Jaho, M Karaliopoulos… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
IEEE Transactions on Parallel and Distributed Systems, 2012ieeexplore.ieee.org
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 …
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.
ieeexplore.ieee.org
Showing the best result for this search. See all results