Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Open Problems in Data-Sharing Peer-to-Peer Systems
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
An empirical study of free-riding behavior in the maze p2p file-sharing system
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A measurement study of the structured overlay network in P2P file-sharing systems
Advances in Multimedia
| Hi-index | 0.00 |
Search in P2P networks is an open problem, and most of P2P networks reflect social relationships. By studying and leveraging social networks of P2P systems, search effect can be significantly improved. In this paper, we report results of analyzing and measuring of social networks in Maze, a large-scale peer-to-peer file sharing system. Given the definition and measurement of social relationship, friend network and download network are analyzed based on Maze's daily log. On both networks, the construction, structure, and "small-world" property are illustrated. And it is proven that both networks reflect social relationships. Leveraging the social networks and EigenTrust algorithm, a search approach EigenForwarding(k,t) is presented. Comparing with flooding and random forwarding, the approach is shown that can gain a good hit rate with small messaging cost and search path length due to sufficient exploiting of sociality.