Please use this identifier to cite or link to this item:
Title: Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces
Authors: Vahdat, Amin 
Krioukov, Dmitri
Boguñá, Marián
Papadopoulos, Fragkiskos 
Category: Electrical Engineering - Electronic Engineering - Information Engineering
Field: Engineering and Technology
Issue Date: 15-Jun-2010
Source: 2010 Proceedings IEEE INFOCOM
Conference: Proceedings IEEE INFOCOM 
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.
ISBN: 9781424458363
ISSN: 2-s2.0-77953303123
DOI: 10.1109/INFCOM.2010.5462131
Type: Conference Papers
Appears in Collections:Δημοσιεύσεις σε συνέδρια/Conference papers

Files in This Item:
File Description SizeFormat
greedy forwarding in dynmaic.pdf303.93 kBAdobe PDFView/Open
Show full item record


checked on Aug 18, 2019

Page view(s)

Last Week
Last month
checked on Aug 23, 2019


checked on Aug 23, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.