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

Authors:
Fragkiskos Papadopoulos;Dmitri Krioukov;Marián Boguñá;Amin Vahdat
Affiliations:
Department of Electrical and Computer Engineering, University of Cyprus;Cooperative Association for Internet Data Analysis;Department de Física Fonamental, Universitat de Barcelona;Department of Computer Science and Engineering, University of California, San Diego
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 8
Cited 6

Handbook of Graphs and Networks: From the Genome to the Internet

Handbook of Graphs and Networks: From the Genome to the Internet
Scalable routing overlay networks

ACM SIGOPS Operating Systems Review
Scalability of routing methods in ad hoc networks

Performance Evaluation - Performance 2005
Algorithms on negatively curved spaces

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)

Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Reconstructing approximate tree metrics

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Scaled Gromov hyperbolic graphs

Journal of Graph Theory
A survey and comparison of peer-to-peer overlay network schemes

IEEE Communications Surveys & Tutorials

Optimal gateway selection in multi-domain wireless networks: a potential game perspective

MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Low distortion delaunay embedding of trees in hyperbolic plane

GD'11 Proceedings of the 19th international conference on Graph Drawing
Random hyperbolic graphs: degree sequence and clustering

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A compact routing scheme and approximate distance oracle for power-law graphs

ACM Transactions on Algorithms (TALG)
Incrementally upgradable data center architecture using hyperbolic tessellations

Computer Networks: The International Journal of Computer and Telecommunications Networking
Shortest-path queries in static networks

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

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.