Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces

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.

[1]  Robert Krauthgamer,et al.  Algorithms on negatively curved spaces , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[2]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Rita H. Wouhaybi,et al.  Phenix: supporting resilient low-diameter peer-to-peer topologies , 2004, IEEE INFOCOM 2004.

[4]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  M. Bridson,et al.  Metric Spaces of Non-Positive Curvature , 1999 .

[6]  R. Pastor-Satorras,et al.  Class of correlated random networks with hidden variables. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Akihiro Nakao,et al.  Scalable routing overlay networks , 2006, OPSR.

[8]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[9]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[10]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[11]  Thomas R. Gross,et al.  Scalability of routing methods in ad hoc networks , 2005, Perform. Evaluation.

[12]  Marián Boguñá,et al.  Navigating ultrasmall worlds in ultrashort time. , 2008, Physical review letters.

[13]  M. Gromov.  Metric Structures for Riemannian and Non-Riemannian Spaces , 1999 .

[14]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[15]  Amin Vahdat,et al.  Efficient Navigation in Scale-Free Networks Embedded in Hyperbolic Metric Spaces , 2008, ArXiv.

[16]  Amin Vahdat,et al.  On curvature and temperature of complex networks , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  E. Jonckheere,et al.  Scaled Gromov hyperbolic graphs , 2008 .

[18]  Yuval Shavitt,et al.  On the curvature of the Internet and its usage for overlay construction and distance estimation , 2004, IEEE INFOCOM 2004.

[19]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[20]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[21]  Mark Crovella,et al.  Hyperbolic Embedding and Routing for Dynamic Graphs , 2009, IEEE INFOCOM 2009.

[22]  Ittai Abraham,et al.  Reconstructing approximate tree metrics , 2007, PODC '07.

[23]  Christos Gkantsidis,et al.  Hybrid search schemes for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[24]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[25]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..