SIGCPR '96 Proceedings of the 1996 ACM SIGCPR/SIGMIS conference on Computer personnel research
IEEE Internet Computing
Modeling and Analysis of Random Walk Search Algorithms in P2P Networks
HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Optimizing random walk search algorithms in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Social Peer-to-Peer for Resource Discovery
PDP '07 Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing
Social Behaviours in P2P Systems: An Efficient Algorithm for Resource Organisation
WETICE '06 Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Improve Peer Cooperation Using Social Networks
ICPPW '07 Proceedings of the 2007 International Conference on Parallel Processing Workshops
The power of choice in random walks: An empirical study
Computer Networks: The International Journal of Computer and Telecommunications Networking
Statistical analysis of the social network and discussion threads in slashdot
Proceedings of the 17th international conference on World Wide Web
Yes, there is a correlation: - from social networks to personal behavior on the web
Proceedings of the 17th international conference on World Wide Web
Planetary-scale views on a large instant-messaging network
Proceedings of the 17th international conference on World Wide Web
Improving cooperation in peer-to-peer systems using social networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks
Performance Evaluation
Hi-index | 0.00 |
Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algorithms on the Internet. In this paper, we model the random walk algorithm in peer-to-peer networks when social information is available. We define the social relationship between two nodes as the knowledge about the resources the other node possesses. We mathematically show that the social information can benefit the searching by extending the existing random walk search model.