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

Abstract

Routing information is the most basic and, perhaps, the most complicated function that networks perform. Conventional wisdom states that to find paths to destinations through the complex network maze, nodes must communicate and exchange information about