Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces
Date Issued
June 15, 2010
DOI
10.1109/INFCOM.2010.5462131
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. ©2010 IEEE.
File(s)![Thumbnail Image]()
Name
greedy forwarding in dynmaic.pdf
Size
303.93 KB
Format
Adobe PDF
Checksum (MD5)
3621d9453b92a074854cc1d22716a1a4