Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Robust incentive techniques for peer-to-peer networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Social Networks in Peer-to-Peer Systems
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 07
Improve peer cooperation using social networks
International Journal of Parallel, Emergent and Distributed Systems
Cooperation through self-similar social networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Modeling random walk search algorithms in unstructured P2P networks with social information
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Cooperative scheduling mechanism for large-scale peer-to-peer computing systems
Journal of Network and Computer Applications
| Hi-index | 0.00 |
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.