Navigating Ultrasmall Worlds in Ultrashort Time

Random scale-free networks are ultrasmall worlds. The average length of the shortest paths in networks of size N scales as ln  ln  N . 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...

Descripción completa

Detalles Bibliográficos
Autores: Boguñá, Marián, Krioukov, Dmitri
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2009
País:España
Institución:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:2445/140070
Acceso en línea:https://hdl.handle.net/2445/140070
Access Level:acceso abierto
Palabra clave:Xarxes d'àrea extensa (Xarxes d'ordinadors)
Wide area networks (Computer networks)
id ES_4e983cde8269c57ed4882d5dfd52bb39
oai_identifier_str oai:recercat.cat:2445/140070
network_acronym_str ES
network_name_str España
repository_id_str
spelling Navigating Ultrasmall Worlds in Ultrashort TimeBoguñá, MariánKrioukov, DmitriXarxes d'àrea extensa (Xarxes d'ordinadors)Wide area networks (Computer networks)Random scale-free networks are ultrasmall worlds. The average length of the shortest paths in networks of size N scales as ln  ln  N . 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 ln  ln  N . 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.American Physical Society2019201920092019info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersion4 p.application/pdfapplication/pdfhttps://hdl.handle.net/2445/140070Articles publicats en revistes (Física de la Matèria Condensada)reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)InglésReproducció del document publicat a: https://doi.org/10.1103/PhysRevLett.102.058701Physical Review Letters, 2009, vol. 102, num. 5, p. 058701https://doi.org/10.1103/PhysRevLett.102.058701(c) American Physical Society, 2009info:eu-repo/semantics/openAccessoai:recercat.cat:2445/1400702026-05-29T05:05:01Z
dc.title.none.fl_str_mv Navigating Ultrasmall Worlds in Ultrashort Time
title Navigating Ultrasmall Worlds in Ultrashort Time
spellingShingle Navigating Ultrasmall Worlds in Ultrashort Time
Boguñá, Marián
Xarxes d'àrea extensa (Xarxes d'ordinadors)
Wide area networks (Computer networks)
title_short Navigating Ultrasmall Worlds in Ultrashort Time
title_full Navigating Ultrasmall Worlds in Ultrashort Time
title_fullStr Navigating Ultrasmall Worlds in Ultrashort Time
title_full_unstemmed Navigating Ultrasmall Worlds in Ultrashort Time
title_sort Navigating Ultrasmall Worlds in Ultrashort Time
dc.creator.none.fl_str_mv Boguñá, Marián
Krioukov, Dmitri
author Boguñá, Marián
author_facet Boguñá, Marián
Krioukov, Dmitri
author_role author
author2 Krioukov, Dmitri
author2_role author
dc.subject.none.fl_str_mv Xarxes d'àrea extensa (Xarxes d'ordinadors)
Wide area networks (Computer networks)
topic Xarxes d'àrea extensa (Xarxes d'ordinadors)
Wide area networks (Computer networks)
description Random scale-free networks are ultrasmall worlds. The average length of the shortest paths in networks of size N scales as ln  ln  N . 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 ln  ln  N . 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.
publishDate 2009
dc.date.none.fl_str_mv 2009
2019
2019
2019
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/2445/140070
url https://hdl.handle.net/2445/140070
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Reproducció del document publicat a: https://doi.org/10.1103/PhysRevLett.102.058701
Physical Review Letters, 2009, vol. 102, num. 5, p. 058701
https://doi.org/10.1103/PhysRevLett.102.058701
dc.rights.none.fl_str_mv (c) American Physical Society, 2009
info:eu-repo/semantics/openAccess
rights_invalid_str_mv (c) American Physical Society, 2009
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 4 p.
application/pdf
application/pdf
dc.publisher.none.fl_str_mv American Physical Society
publisher.none.fl_str_mv American Physical Society
dc.source.none.fl_str_mv Articles publicats en revistes (Física de la Matèria Condensada)
reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869407766562471936
score 15,81155

Similares en LA Referencia