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

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

2008-05-09

arxiv.org/abs/0805.1266v3

INFOCOM 2010, p.2973-2981

Physics

Condensed Matter

Statistical Mechanics

Scientific paper

10.1109/INFCOM.2010.5462131

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.

Affiliated with

Also associated with

No associations

Rating

Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-332031