A multidimensional heuristic for social routing in peer-to-peer networks

A fundamental problem encountered in designing decentralized social applications is the issue of efficiently locating target nodes in social peer-to-peer networks based on local information only. The unique “small-world” phenomenon of social networks shows that a typical pair of nodes is connected by very short chains of intermediate friends, and individuals are able to collectively discover such short paths. In this paper, we propose a decentralized algorithm that exploits this “small-world” phenomenon to discover efficient routes to reach target nodes in unstructured social overlays. In order to test the performance of this algorithm, we simulate it on a real-world social graph dataset crawled from a large online social networking website (LiveJournal). Compared with other related works, the simulation results show that our proposed decentralized social routing algorithm not only shortens the median length of the search path, but also increases the success rate of finding such routes between arbitrary pair of nodes in the LiveJournal social graph.

[1]  Pierre St. Juste,et al.  SocialVPN: Enabling wide-area collaboration with integrated social and overlay networks , 2010, Comput. Networks.

[2]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

[3]  Daniel Stutzbach,et al.  Characterizing the two-tier gnutella topology , 2005, SIGMETRICS '05.

[4]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[5]  Jasmine Novak,et al.  Geographic routing in social networks , 2005, Proc. Natl. Acad. Sci. USA.

[6]  Oskar Sandberg,et al.  Distributed Routing in Small-World Networks , 2006, ALENEX.

[7]  Joe Morehead.  Government Serials INTO THE HOPPER: DECISION LISTS AND THE U.S. BOARD ON GEOGRAPHIC NAMES , 1981 .

[8]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[9]  D. Watts,et al.  An Experimental Study of Search in Global Social Networks , 2003, Science.

[10]  Hector Garcia-Molina,et al.  Semantic Overlay Networks for P2P Systems , 2004, AP2PC.

[11]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[12]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[14]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[15]  Steffen Staab,et al.  Semantic social overlay networks , 2007, IEEE Journal on Selected Areas in Communications.

[16]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[17]  Lada A. Adamic,et al.  How to search a social network , 2005, Soc. Networks.

[18]  Gueorgi Kossinets,et al.  Empirical Analysis of an Evolving Social Network , 2006, Science.

[19]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.