---
abstract: 'We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious. Nevertheless, greedy packets find their destinations with $100\%$ probability following almost optimal shortest paths. This remarkable efficiency sustains even in highly dynamic networks. Our findings suggest that forwarding information through complex networks, such as the Internet, is possible without the overhead of existing routing protocols, and may also find practical applications in overlay networks for tasks such as application-level routing, information sharing, and data distribution.'
author:
- 'Fragkiskos Papadopoulos, Dmitri Krioukov, Mari[á]{}n Bogu[ñ]{}[á]{}, and Amin Vahdat [^1]'
title: 'Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces'
---

paper.bbl

[^1]: F. P. is with the Department of Electrical and Computer Engineering, University of Cyprus. D. K. is with the Cooperative Association for Internet Data Analysis (CAIDA), and A. V. is with the Department of Computer Science and Engineering, University of California, San Diego (UCSD). M. B. is with Department de F[í]{}sica Fonamental, Universitat de Barcelona. The work was supported by NSF CNS-0722070 and Cisco Systems, and done while the first author was with CAIDA.
