%0 Conference Paper %1 wang2006improving %A Wang, Wenyu %A Zhao, Li %A Yuan, Ruixi %B Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International %D 2006 %K p2p socialnetwork %R 10.1109/IPDPS.2006.1639703 %T Improving cooperation in peer-to-peer systems using social networks %U http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=34366&arnumber=1639703&count=468&index=445 %X Rational and selfish nodes in P2P systems usually lack effective incentives to cooperate, contributing to the increase of free-riders, and degrading the system performance. Various attacks such as whitewashing, collusion, and software cracking pose great challenges on distributed reputation management. To tackle these problems, we propose to build a social network on P2P system, and use the strength of social connections to facilitate transactions in P2P system. The' small world' character of social networks makes it feasible for nodes to locate resources and conduct transactions while maintain limited local memory history. Such distributed memory combined by relationship between peers constructs a powerful reputation management network, which could have better performance than shared history system and is more robust under various attacks. Our simulation and analysis show that the social network model can greatly incent cooperation in P2P networks and enormously reduce the memory cost. %@ 1-4244-0054-6

@inproceedings{wang2006improving, abstract = {Rational and selfish nodes in P2P systems usually lack effective incentives to cooperate, contributing to the increase of free-riders, and degrading the system performance. Various attacks such as whitewashing, collusion, and software cracking pose great challenges on distributed reputation management. To tackle these problems, we propose to build a social network on P2P system, and use the strength of social connections to facilitate transactions in P2P system. The' small world' character of social networks makes it feasible for nodes to locate resources and conduct transactions while maintain limited local memory history. Such distributed memory combined by relationship between peers constructs a powerful reputation management network, which could have better performance than shared history system and is more robust under various attacks. Our simulation and analysis show that the social network model can greatly incent cooperation in P2P networks and enormously reduce the memory cost.}, added-at = {2007-04-16T16:51:20.000+0200}, author = {Wang, Wenyu and Zhao, Li and Yuan, Ruixi}, biburl = {https://www.bibsonomy.org/bibtex/28a5704ad4f7a7b741cf953fc65422264/schmitz}, booktitle = {Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International}, description = {Improving cooperation in peer-to-peer systems using social networks}, doi = {10.1109/IPDPS.2006.1639703}, interhash = {51107521c45a16a1e16abaa2d59dfc35}, intrahash = {8a5704ad4f7a7b741cf953fc65422264}, isbn = {1-4244-0054-6}, keywords = {p2p socialnetwork}, timestamp = {2007-04-16T16:51:20.000+0200}, title = {Improving cooperation in peer-to-peer systems using social networks}, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=34366&arnumber=1639703&count=468&index=445}, year = 2006 }