Local Search in Unstructured Networks

We review a number of message-passing algorithms that can be used to search through power-law networks. Most of these algorithms are meant to be improvements for peer-to-peer file sharing systems, and some may also shed some light on how unstructured social networks with certain topologies might function relatively efficiently with local information. Like the networks that they are designed for, these algorithms are completely decentralized, and they exploit the power-law link distribution in the node degree. We demonstrate that some of these search algorithms can work well on real Gnutella networks, scale sub-linearly with the number of nodes, and may help reduce the network search traffic that tends to cripple such networks.

[1]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[2]  B. Bollobás The evolution of random graphs , 1984 .

[3]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[4]  홍원식 Performance , 2005 .

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Lauren Wood 技術解説 IEEE Internet Computing , 1999 .

[7]  Lada A. Adamic The Small World Web , 1999, ECDL.

[8]  Lada A. Adamic,et al.  Internet: Growth dynamics of the World-Wide Web , 1999, Nature.

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[11]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[12]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[13]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[14]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[15]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

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

[17]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  A. Oram Peer-to-Peer , 2001 .

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

[20]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[21]  A. Rbnyi ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[22]  B. Wellman Computer Networks As Social Networks , 2001, Science.

[23]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[24]  S Redner,et al.  Degree distributions of growing networks. , 2001, Physical review letters.

[25]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[26]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[27]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[28]  Ian Clarke,et al.  Protecting Free Expression Online with Freenet , 2002, IEEE Internet Comput..

[29]  Beom Jun Kim,et al.  Path finding strategies in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[31]  D. Meadows-Klue The Tipping Point: How Little Things Can Make a Big Difference , 2004 .