Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces: Technical Report
F. Papadopoulos, D. Krioukov, M. Boguñá, and A. Vahdat, "Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces: Technical Report", Tech. rep., Cooperative Association for Internet Data Analysis (CAIDA), Jul 2009.
|   View full paper:    PDF    |  Citation:    BibTeX   |

Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces: Technical Report

Fragkiskos Papadopoulos1
Dmitri Krioukov1
Marián Boguñá2
Amin Vahdat3
1

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

2

Departament de Física Fonamental, Universitat de Barcelona

3

Department of Computer Science and Engineering,
University of California, San Diego

In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally efficient greedy forwarding on these topologies where packets can find their destinations with 100% probability following almost optimal, i.e., shortest paths, without the need for global topology knowledge. We demonstrate that this remarkable efficiency is robust under dynamic network conditions. Our findings suggest that forwarding information through complex networks, e.g., like the Internet, may be possible without the current overhead of routing protocols, and may also find practical applications in overlay networks for tasks such as application-level routing, information sharing, and data distribution.

Keywords: routing, topology
  Last Modified: Wed Oct-11-2017 17:03:55 PDT
  Page URL: http://www.caida.org/publications/papers/2009/tr-2009-02/index.xml