Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis > publications : papers : 2009 : navigating_ultrasmall
Navigating ultrasmall worlds in ultrashort time
M. Boguñá and D. Krioukov, "Navigating ultrasmall worlds in ultrashort time", Physical Review Letters, vol. 102, no. 058701, Feb 2009.
|   View full paper:    PDF    DOI    |  Citation:    BibTeX   |

Navigating ultrasmall worlds in ultrashort time

Marián Boguñá 2
Dmitri Krioukov 1

CAIDA, San Diego Supercomputer Center, University of California San Diego


Departament de Física Fonamental, Universitat de Barcelona

Random scale-free networks are ultrasmall worlds. The average length of the shortest paths in networks of size N scales as lnlnN. Here we show that these ultrasmall worlds can be navigated in ultrashort time. Greedy routing on scale-free networks embedded in metric spaces finds paths with the average length scaling also as lnlnN. Greedy routing uses only local information to navigate a network. Nevertheless, it finds asymptotically the shortest paths, a direct computation of which requires global topology knowledge. Our findings imply that the peculiar structure of complex networks ensures that the lack of global topological awareness has asymptotically no impact on the length of communication paths. These results have important consequences for communication systems such as the Internet, where maintaining knowledge of current topology is a major scalability bottleneck.

Keywords: routing, topology
  Last Modified: Wed Oct-11-2017 17:03:55 PDT
  Page URL: