Geographic routing in social networks
We live in a “small world,” where two arbitrary people are likely connected by a short chain
of intermediate friends. With scant information about a target individual, people can …
of intermediate friends. With scant information about a target individual, people can …
Navigability of complex networks
Routing information through networks is a universal phenomenon in both natural and man-
made complex systems. When each node has full knowledge of the global network …
made complex systems. When each node has full knowledge of the global network …
[書籍][B] An introduction to search engines and web navigation
M Levene - 2011 - books.google.com
This book is a second edition, updated and expanded to explain the technologies that help
us find information on the web. Search engines and web navigation tools have become …
us find information on the web. Search engines and web navigation tools have become …
[PDF][PDF] Complex networks and decentralized search algorithms
J Kleinberg - Proceedings of the International Congress of …, 2006 - Citeseer
The study of complex networks has emerged over the past several years as a theme
spanning many disciplines, ranging from mathematics and computer science to the social …
spanning many disciplines, ranging from mathematics and computer science to the social …
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit
efficient greedy routing, eg, randomized hypercubes, randomized Chord, skip-graphs and …
efficient greedy routing, eg, randomized hypercubes, randomized Chord, skip-graphs and …
Analyzing Kleinberg's (and other) small-world models
C Martel, V Nguyen - Proceedings of the twenty-third annual ACM …, 2004 - dl.acm.org
We analyze the properties of Small-World networks, where links are much more likely to
connect" neighbor nodes" than distant nodes. In particular, our analysis provides new results …
connect" neighbor nodes" than distant nodes. In particular, our analysis provides new results …
D2B: A de Bruijn based content-addressable network
P Fraigniaud, P Gauron - Theoretical Computer Science, 2006 - Elsevier
We show that the de Bruijn graph is appropriate for maintaining dynamic connections, eg,
between the members of a P2P application who join and leave the system at their …
between the members of a P2P application who join and leave the system at their …
A protocol for recording provenance in service-oriented grids
Both the scientific and business communities, which are beginning to rely on Grids as
problem-solving mechanisms, have requirements in terms of provenance. The provenance …
problem-solving mechanisms, have requirements in terms of provenance. The provenance …
Distance estimation and object location via rings of neighbors
A Slivkins - Proceedings of the twenty-fourth annual ACM …, 2005 - dl.acm.org
We consider four problems on distance estimation and object location: low-stretch routing
schemes [37], distance labeling [14], searchable small worlds [22], and triangulation-based …
schemes [37], distance labeling [14], searchable small worlds [22], and triangulation-based …
Navigation in spatial networks: A survey
The study on the navigation process in spatial networks has attracted much attention in
recent years due to the universal applications in real communication networks. This article …
recent years due to the universal applications in real communication networks. This article …