Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information

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.

[1]  Vincenza Carchiolo,et al.  Social Behaviours in P2P Systems: An Efficient Algorithm for Resource Organisation , 2006, 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE'06).

[2]  Jie Wu,et al.  Improve Peer Cooperation Using Social Networks , 2007, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007).

[3]  Nick Antonopoulos,et al.  Social Peer-to-Peer for Resource Discovery , 2007, 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07).

[4]  Ian T. Foster,et al.  Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems , 2002, IPTPS.

[5]  Li Zhao,et al.  Improving cooperation in peer-to-peer systems using social networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[6]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks: Algorithms and evaluation , 2006, Perform. Evaluation.

[7]  Jure Leskovec,et al.  Planetary-scale views on a large instant-messaging network , 2008, WWW.

[8]  Barry Wellman,et al.  For a social network analysis of computer networks: a sociological perspective on collaborative work and virtual community , 1996, SIGCPR '96.

[9]  Vicenç Gómez,et al.  Statistical analysis of the social network and discussion threads in slashdot , 2008, WWW.

[10]  Bhaskar Krishnamachari,et al.  The power of choice in random walks: An empirical study , 2008, Comput. Networks.

[11]  Edith Cohen,et al.  Associative search in peer to peer networks: harnessing latent semantics , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[13]  Alhussein A. Abouzeid,et al.  Optimizing random walk search algorithms in P2P networks , 2007, Comput. Networks.

[14]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[15]  Alhussein A. Abouzeid,et al.  Modeling and analysis of random walk search algorithms in P2P networks , 2005 .

[16]  Matthew Richardson,et al.  Yes, there is a correlation: - from social networks to personal behavior on the web , 2008, WWW.

[17]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[18]  P. V. Marsden,et al.  Measuring Tie Strength , 1984 .