Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis
www.caida.org > publications : papers : 2010 : greedy_forwarding_dynamic
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
F. Papadopoulos, D. Krioukov, M. Boguñá, and A. Vahdat, "Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces", in IEEE Conference on Computer Communications (INFOCOM), Mar 2010.

From the proceedings of IEEE INFOCOM 2010 in March 2010.

|   View full paper:    PDF    DOI    Related Presentation    |  Citation:    BibTeX   |

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

Fragkiskos Papadopoulos 4
Dmitri Krioukov 1
Marián Boguñá 2
Amin Vahdat 3
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

4

University of Cyprus

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.

Keywords: network geometry, routing, topology
  Last Modified: Wed Oct-11-2017 17:03:56 PDT
  Page URL: http://www.caida.org/publications/papers/2010/greedy_forwarding_dynamic/index.xml