Greedy Forwarding in Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov Fragkiskos Papadopoulos Cooperative Association for Internet Data Analysis University of California, San Diego Marián Boguñá marian.boguna@ub.edu Universitat de Barcelona Amin Vahdat University of California, San Diego {dima, frag}@caida.org 1. INTRODUCTION vahdat@cs.ucsd.edu that the spaces hidden beneath the Internet and other real networks are not Euclidean planes. The main results of our work is that if we model hidden spaces as non-Euclidean hyperbolic spaces, then their negative curvature leads to: (i) natural emergence of scale-free topologies constructed over such hidden spaces; and (ii) extremely ef cient greedy forwarding on these topologies, achieving almost 100% reachability and optimal (i.e., shortest) path lengths, even under dynamic network conditions. Routing information is the most basic and, perhaps, the most complicated function that networks perform. Conventional wisdom states that to nd paths to destinations through the complex network maze, nodes must communicate and exchange information about the status of their connections to other nodes. This communication overhead is considered one of the most serious scaling limitations of our primary communication technologies today, including the Internet [6] and emerging wireless and sensor networks [7]. In many other networks in nature however, nodes
End of preview. The entire article is 3 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/greedy-forwarding-in-scale-free-networks-embedded-in-hyperbolic-metric-a60hvbnBCe
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces
Krioukov, Dmitri; Papadopoulos, Fragkiskos; Boguñá, Marián; Vahdat, Amin
Follow ACM SIGMETRICS Performance Evaluation Review
, Volume 37 (2)
Association for Computing Machinery – Oct 16, 2009
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
